Propagating Minimal Messages Using Multi Set-Cover in Wireless Ad-Hoc Network

Wireless (ad hoc) network is a group of nodes to communicate with each other over a wireless channel to receive and transmit data packets among their neighbors residing in the transmission range. We propose to build a wireless ad hoc network to maintain data transmission in a cost-effective way with minimal data packets. This transmission of data can commence in conditions/circumstances which are challenged and harsh to continue without failure caused by any network, environmental or other factors and ensure fault tolerance in such kind of noisy network. In spite of having vast research experiments in this area, existent studies shows lack effort in establishing both balanced coverage of two hop neighbors of sender and fault tolerance in the network with minimal message propagation at the same time. In this paper, a new algorithm using two hop distant neighbor information is proposed and a special version of set cover problem suited to ad hoc networks is used to output multiple forwarder lists by which, all the uncovered two hop neighbors are covered once. Extensive simulations made in NS2 implementation show that the algorithm provides high delivery rate (88% in average) of packets and transmission of average number of packets is lower than existent Dominant Pruning algorithm. Later we analyzed the reachability aspect of the algorithm by calculating the percentage of nodes (receivers) reached in presence of various fractions of malfunctioning nodes integrated deliberately by us in the network.

[1]  Pawel Gburzynski,et al.  Enhanced Dominant Pruning-based Broadcasting in Untrusted Ad-hoc Wireless Networks , 2007, 2007 IEEE International Conference on Communications.

[2]  Yunghsiang Sam Han,et al.  Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency , 2007, IEEE Transactions on Communications.

[3]  Ashikur Rahman,et al.  Fault tolerant optimized broadcast for wireless Ad-Hoc networks , 2016, 2016 International Conference on Networking Systems and Security (NSysS).

[4]  Roger Wattenhofer,et al.  Fault-Tolerant Clustering in Ad Hoc and Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[5]  Charles E. Perkins,et al.  An implementation study of the AODV routing protocol , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[6]  Ming Liu,et al.  A Survey of Coverage Problems in Wireless Sensor Networks , 2014 .

[7]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[8]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[9]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  James S. Lehnert,et al.  Optimizing ZF precoders for MIMO broadcast systems , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[12]  Ah-Lian Kor,et al.  Building Realistic Mobility Models for Mobile Ad Hoc Networks , 2018, Informatics.

[13]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[14]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[15]  Teresa A. Dahlberg,et al.  Providing fault tolerance in wireless access networks , 2002, IEEE Commun. Mag..

[16]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[17]  Qi Han,et al.  Journal of Network and Systems Management ( c ○ 2007) DOI: 10.1007/s10922-007-9062-0 A Survey of Fault Management in Wireless Sensor Networks , 2022 .

[18]  Shimon Even,et al.  Graph Algorithms , 1979 .

[19]  Arun Somani,et al.  Distributed fault detection of wireless sensor networks , 2006, DIWANS '06.

[20]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[21]  Wendi B. Heinzelman,et al.  Cluster head election techniques for coverage preservation in wireless sensor networks , 2009, Ad Hoc Networks.

[22]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[23]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[24]  M. Potkonjak,et al.  Fault tolerance techniques for wireless ad hoc sensor networks , 2002, Proceedings of IEEE Sensors.