The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Self Organized Terminode Routing
Cluster Computing
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
JANE-The Java Ad Hoc Network Development Environment
ANSS '07 Proceedings of the 40th Annual Simulation Symposium
HyTrace Backbone-Assisted Path Discovery in Hybrid Networks
CTRQ '08 Proceedings of the 2008 International Conference on Communication Theory, Reliability, and Quality of Service
NLWCA Node and Link Weighted Clustering Algorithm for Backbone-Assisted Mobile Ad Hoc Networks
ICN '08 Proceedings of the Seventh International Conference on Networking
OLSR and WCPD as Basis for Service Discovery in MANETs
UBICOMM '08 Proceedings of the 2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
A stable linked structure flooding for mobile ad hoc networks with fault recovery
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
| Hi-index | 0.00 |
For some applications in ad hoc networks optimal dissemination is a key issue (e.g. service discovery, network management). In this paper, we are creating and exploiting stable (sub-)structures to achieve an efficient (as far as low network resource usage is concerned) dissemination by building a two-layer protocol. Firstly, single-hop clusters, among stable-connected devices, are created. Secondly, on top of those clusters, inter-cluster relays (ICR) are determined. This leads to an overall stable-connected structure. The results show that the proposed stable linked structure flooding (SLSF) protocol efficiently disseminates data among stable nodes. Interestingly with growing density both the number of forwarding nodes and the bandwidth used remain comparatively low. Therefore we plan to use SLSF as a basis for a stable service discovery.