A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. ...
We provide an algorithm which broadcasts correctly with probability 1 − in faulty random geometric radio networks of diameter D in time O(D + log 1/ ). ...
Andrzej Pelc was supported by the Research Chair in Distributed Computing of the Université du Québec en Outaouais and NSERC. ...
doi:10.1007/978-3-540-85209-4_9
fatcat:7gpjqfbjhragbly7wjftce7a6y
Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks
2009
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We address multi-radio networks, i.e., wireless networks where the nodes are equipped with multiple air interfaces. ...
We validate the theoretical results via simulations and show that similar phenomena occur in geometric random graph models. ...
Choosing Random Graphs The type of random graph that is most frequently used to model mobile wireless networks is the random geometric graph [9] . ...
doi:10.1109/glocom.2009.5425728
dblp:conf/globecom/BasagniFNT09
fatcat:huuvdondpvabrlptti72g2nwna
Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with Bernoulli nodes
2003
2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Nodes in wireless ad hoc networks may become inactive or unavailable due to, for example, internal breakdown or being in the sleeping state. ...
We assume that the wireless ad hoc network consists of nodes which are distributed independently and uniformly in a unit-area disk, and are active (or available) independently with probability for some ...
networks of short-range radio nodes, due to the presence of local correlation among radio links. ...
doi:10.1109/wcnc.2003.1200623
dblp:conf/wcnc/YiWLF03
fatcat:rw7oivmzsvdczk5lvn4goml7m4
Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with Bernoulli nodes
2006
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Nodes in wireless ad hoc networks may become inactive or unavailable due to, for example, internal breakdown or being in the sleeping state. ...
We assume that the wireless ad hoc network consists of nodes which are distributed independently and uniformly in a unit-area disk, and are active (or available) independently with probability for some ...
networks of short-range radio nodes, due to the presence of local correlation among radio links. ...
doi:10.1109/tcomm.2006.869803
fatcat:lyssrezdmndshesk6othesxf4e
Erasure Correction for Noisy Radio Networks
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work we quantify the relative computational power of noisy radio networks and classic radio networks. ...
The recently introduced noisy radio network model relaxes this assumption by dropping messages independently at random. ...
[33] consider radio networks with possibly correlated faults at nodes. ...
arXiv:1805.04165v3
fatcat:mxq6gtoevvhvha2ffvoq54zdfy
Evaluation of Channel Assignment Performance Prediction Techniques in Random Wireless Mesh Networks
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
2015
2015 International Conference on Computing and Network Communications (CoCoNet)
unpublished
doi:10.1109/coconet.2015.7411298 fatcat:lxhx56ykrfcfbf6nykti6ycwii
doi:10.1109/coconet.2015.7411298 fatcat:lxhx56ykrfcfbf6nykti6ycwii
We obtain conclusive results to demonstrate the efficacy of proposed schemes in random WMNs as well. ...
Thus, interference alleviation is a fundamental design concern in multi-radio multi-channel (MRMC) WMNs, and is achieved through a judicious channel assignment (CA) to the radios in a WMN. ...
We illustrate the expected correlation in Figure 1 . With rise in interference the performance of a wireless network deteriorates. ...
arXiv:1511.04763v1
fatcat:b4lzgi6bnfaqhd7b5y3xh2pqf4
Chameleon-MAC: Adaptive and Self-⋆ Algorithms for Media Access Control in Mobile Ad Hoc Networks
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In mobile ad hoc networks (MANETs) mobile nodes do not have access to a fixed network infrastructure and they set up a communication network by themselves. ...
Existing MAC algorithms that consider no mobility, solve the problem of eventually guaranteeing every node with a share of the communications bandwidth. ...
radio interference and it can quickly recover from such faults. ...
doi:10.1007/978-3-642-16023-3_37
fatcat:hzwf7dvxzzhchov2mjoxqrjp7q
Connectivity, Coverage and Placement in Wireless Sensor Networks
2009
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. ...
However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. ...
[33] considered a geometric random graph model of a wireless packet radio network with a Poisson process of nodes within a finite but large area A. ...
doi:10.3390/s91007664
pmid:22408474
pmcid:PMC3292077
fatcat:p5syny5qzngkbp6rc3tmhkq5ty
A Review Study on Analytical Estimation of Optimal Number of Clusters in Wireless Sensor Networks
2014
Transactions on Networks and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
WSNs are large-scale networks of small embedded devices, each with sensing, computation and communication capabilities and have been widely discussed in [1, 2, 8, 20] . ...
Selection of optimal number of clusters in WSNs is affected by level at which WSNs is modeled viz. Radio Energy Model Level, Network Model Level and Clustering Level. ...
It is found that with non-uniform clustering in heterogeneous WSNs, clusters are more energy-efficient in WSNs with spatial data correlation. ...
doi:10.14738/tnc.25.488
fatcat:3a67gqxwzrgmbozpwlci2ef7lq
Computational Aspects of Sensor Network Protocols (Distributed Sensor Network Simulator)
2009
Sensors & Transducers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In a lossless mode if there are no faults in the sensor network then we can show that the highest probability given by Pmax is ambiguous if its frequency is ≤ n/2 otherwise it can be determined by a local ...
From these bounds in large network, it is observed that the power dissipation is network size invariant. ...
Acknowledgements One of the authors (VI) would like to thank the department of Computer Science Louisiana State University for funding Wireless Sensor Network simulator and implementation of various routing ...
doaj:d4c627435d7a4a26a7c5ce6fc56aaeb5
fatcat:bxyj6vukkjg6faw7kirvcbidz4
Recent Advances in Complex Networks Theories with Applications
2014
The Scientific World Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It clusters faster and plays a positive role in revealing the real cluster structure of complex networks precisely. ...
"SVM-based spectrum mobility prediction scheme in mobile cognitive radio networks" by Y. ...
Acknowledgments We would like to express appreciation to the authors for their excellent contributions and patience in assisting us. ...
doi:10.1155/2014/504923
pmid:25152914
pmcid:PMC4134825
fatcat:pqny2b2h6ves3iqcglofqtexju
2012 TMC Annual Index
2013
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Yang, Ou, +, TMC June 2012 905-921 Radio access networks A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access. ...
Sinanović, Sinan, +,
TMC Dec. 2012 2121-2132
Temporal Correlation of Interference in Wireless Networks with Rayleigh
Block Fading. ...
doi:10.1109/tmc.2013.1
fatcat:qp57tpkfx5gbrc3dvtetebm3ui
An Analytical Expression for k-connectivity of Wireless Ad Hoc Networks
2014
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In case of k-connected wireless sensor network (WSNs), this technique permits the routing of data packets or messages via individual (one or more) of minimum k node disjoint communication paths, but the ...
fading, and nakagami fading in the ad hoc communication environment, by means of shadowing and fading phenomenon. ...
analyze the randomness in network channel with the help of channel diversity. ...
doi:10.12928/telkomnika.v12i1.26
fatcat:abjpwzxsf5drdoji3uoikjejiq
Mobile Wireless Sensor Networks: An Overview
[chapter]
2017
Wireless Sensor Networks - Insights and Innovations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Also, they can change their position frequently in a specific sensing area. ...
Mobile wireless sensor networks (MWSNs) have emerged and shifted the focus from the typical static wireless sensor networks to networks with mobile sensor nodes that are capable to sense the various types ...
This chapter presented in detail the research carried on the large-scale mobile wireless sensor networks. ...
doi:10.5772/intechopen.70592
fatcat:thdat6ymkffc3irfurci4kwra4
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
2016
International Journal of Next-Generation Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Random deployment of sensor nodes causes the wireless sensor networks to face topological weaknesses such as communication bottlenecks, network partitions and sensing holes. ...
Deployment strategies are compared with respect to network parameters such as throughput, packet delivery fraction and network lifetime. ...
These zones are replaced with random additional nodes and targeted additional nodes, to enhance network lifetime. ...
doi:10.5121/ijngn.2016.8301
fatcat:lqatzgbhgzcdxlgwk5ktacn6yy
« Previous
Showing results 1 — 15 out of 2,658 results