10 Technology
http://hdl.handle.net/10453/27
Thu, 24 Jul 2014 22:30:43 GMT2014-07-24T22:30:43ZConnectivity of Large Wireless Networks under a General Connection Model
http://hdl.handle.net/10453/27913
Connectivity of Large Wireless Networks under a General Connection Model
Mao, Guoqiang; Anderson, Brian
This paper studies networks where all nodes are distributed on a unit square A=? [- [1/2], [1/2]]2 following a Poisson distribution with known density ? and a pair of nodes separated by an Euclidean distance x are directly connected with probability gr?(x)=?g(x/r?), independent of the event that any other pair of nodes are directly connected. Here, g:[0,8)? [0,1] satisfies the conditions of rotational invariance, nonincreasing monotonicity, integral boundedness, and g(x)=o(1/(x2log2x)) ; further, r?=v{(log?+b)/(C?)} where C=?R2g(||x||)dx and b is a constant. Denote the aforementioned network by G(X?,gr?,A). We show that as ?? 8, 1) the distribution of the number of isolated nodes in G(X?,gr?,A) converges to a Poisson distribution with mean e-b ; 2) asymptotically almost surely (a.a.s.) there is no component in G(X?,gr?,A) of fixed and finite order k >; 1; c) a.a.s. the number of components with an unbounded order is one. Therefore, as ?? 8, the network a.a.s. contains a unique unbounded component and isolated nodes only; a sufficient and necessary condition for G(X?,gr?,A) to be a.a.s. connected is that there is no isolated node in the network, which occurs when b? 8 as ?? 8. These results expand recent results obtained for- connectivity of random geometric graphs from the unit disk model and the fewer results from the log-normal model to the more general and more practical random connection model.
Tue, 01 Jan 2013 00:00:00 GMThttp://hdl.handle.net/10453/279132013-01-01T00:00:00ZPerformance Analysis of Distributed Raptor Codes in Wireless Sensor Networks
http://hdl.handle.net/10453/27914
Performance Analysis of Distributed Raptor Codes in Wireless Sensor Networks
Yue, Jing; Lin, Zihuai; Vucetic, Branka; Mao, Guoqiang; Aulin, Tor
Distributed network coding, wireless sensor networks, Raptor codes, Quasi-static Rayleigh fading channel, upper and lower bounds
Tue, 01 Jan 2013 00:00:00 GMThttp://hdl.handle.net/10453/279142013-01-01T00:00:00ZA Tuned Fuzzy Logic Relocation Model in WSNs Using Particle Swarm Optimization
http://hdl.handle.net/10453/27613
A Tuned Fuzzy Logic Relocation Model in WSNs Using Particle Swarm Optimization
Rafiei, Ali; Maali, Yashar; Abolhasan, Mehran; Franklin, Daniel; Safaei, Farzad; Smith, Stephen
To be announced (TBA)
Tue, 01 Jan 2013 00:00:00 GMThttp://hdl.handle.net/10453/276132013-01-01T00:00:00ZSEP of Multihop Relay Networks in Nakagami-m Fading Channels
http://hdl.handle.net/10453/27612
SEP of Multihop Relay Networks in Nakagami-m Fading Channels
Barua, Bappi; Abolhasan, Mehran; Franklin, Daniel; Safaei, Farzad
Technical program committee
In this paper we analyze the error performance of a cooperative multihop parallel relay network over Nakagami-m fading channels using M-ary Phase-shift keying (MPSK) modulation. We derive the general closed form expression of the symbol error probability (SEP) and present numerical results on the performance of the network.
Tue, 01 Jan 2013 00:00:00 GMThttp://hdl.handle.net/10453/276122013-01-01T00:00:00Z