Topics in matrix analysis
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Capacity bounds of deployment concepts for Wireless Mesh Networks
Performance Evaluation
A survey on MAC protocols for cognitive radio networks
Ad Hoc Networks
Secure group communication in wireless mesh networks
Ad Hoc Networks
Markov Chain-based performance analysis of multihop IEEE 802.15.4 wireless networks
Performance Evaluation
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperative relay to improve diversity in cognitive radio networks
IEEE Communications Magazine
Gateway selection and routing in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
MAC-layer proactive mixing for network coding in multi-hop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Low-complexity and distributed energy minimization in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
On scaling the IEEE 802.11 to facilitate scalable wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing in cognitive radio networks: Challenges and solutions
Ad Hoc Networks
Load-aware routing in mesh networks: Models, algorithms and experimentation
Computer Communications
IEEE Transactions on Information Theory
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Recently great attention has been posed on the consensus protocols in networks of agents. A widely studied consensus algorithm allows every agent automatically converge to a common consensus state using only local information received from its one hop neighboring agents. We study the problem of reaching a consensus in network of mesh nodes under m-hop protocols where each node-agent can access to the state of its m-steps neighboring agents. Moreover we consider also the presence of heterogeneous time delays affecting the communication through the different hops. The first aim of the paper in the WMNs research theoretical foundations is to give a sufficient condition for the multi hop network consensus protocol stability in the presence of heterogeneous time delays that explicitly relates the network and algorithm features (e.g. time delay tolerance, topology, the number of hop). The second aim is to point out by the previous analytical condition the interplay between the network performance/features (i.e. reliability, the delay tolerance, the communication topology) and the effectiveness of the distributed consensus algorithms/communication protocols (i.e. in terms of complexity, amount of the information to be managed, responsiveness and steady state error performance). This trade off must be taken into account in the performance evaluation and algorithm design for WMNs. Finally, the theoretical result has been validated by simulation experiments using a realistic evaluation environment.