Extended multipoint relays to determine connected dominating sets in MANETs

Wu, Jie; Lou, Wei; Dai, F.

doi:10.1109/tc.2006.40

Cited by 108 publications

(70 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Wu et al [5] have explained several extensions designed to generate smaller CDSs using complete two-hop information. The complete two-hop information of node V is denoted by…”

Section: Connected Dominating Setmentioning

confidence: 99%

Shared MPR Sets for Moderately Dense Wireless Multihop Networks

Kitasuka

Tagashira

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Multipoint relays (MPRs) are used for flooding topology control messages and finding the shortest paths for unicast communications in the optimized link state routing protocol (OLSR). In this paper, we propose a method for achieving more efficient MPR selection in moderately dense wireless multihop networks (including sensor networks) than the conventional MPR selection. First, we analyze moderately dense networks to show that a node close to the two-hop border has little probability of being a two-hop neighbor. Second, we explain that there is a chance of the node's MPRs being shared with its neighbors. To maximize this chance, we propose using shared MPR sets. These sets minimize the MPR ratio, which is defined as the number of nodes selected as MPRs by at least one neighbor divided by the total number of nodes in the network. Simulations are used to confirm the efficiency of using shared MPR sets. A centralized heuristic algorithm shows an MPR ratio redundancy in moderately dense networks that is about 10% of that obtained through conventional MPR selection.

show abstract

“…Wu et al [5] have explained several extensions designed to generate smaller CDSs using complete two-hop information. The complete two-hop information of node V is denoted by…”

Section: Connected Dominating Setmentioning

confidence: 99%

Shared MPR Sets for Moderately Dense Wireless Multihop Networks

Kitasuka

Tagashira

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…But in some researches such as [29][30][31][32][33][34][35][36][37][38], the objectives of CDS construction are not or not only minimizing the size of the CDS. For example, in [29], Kim et al proposed two centralized algorithms.…”

Section: Related Studymentioning

confidence: 99%

An energy efficient MCDS construction algorithm for wireless sensor networks

Tang

Yang

et al. 2012

J Wireless Com Network

View full text Add to dashboard Cite

In wireless sensor network, a connected dominating set (CDS) can be used as a virtual backbone for efficient routing. Constructing a minimal CDS (MCDS) is good for packet routing and energy efficiency, but is an NP-hard problem. In this article, an efficient approximation MCDS construction algorithm E-MCDS (energy efficient MCDS construction algorithm) is proposed which explicitly takes energy consumption into account. E-MCDS contains two stages: the CDS construction stage and the pruning stage. The constructed CDS is approximately composed of two independent sets (IS). The performance ratio of E-MCDS is analysed in both unit disk graph and disk graphs with bidirectional links, being 9.33opt and 17.33n k opt, respectively. The message complexity of E-MCDS is O(n). The simulation results have shown that E-MCDS performs well both in terms of the size of CDS constructed and the energy efficiency.

show abstract

“…Congestion free route discovery: Each mobile node chooses its CFS (Wu et al, 2006;Yen et al, 2010) set from its non-congested 1-hop neighbors. The CFS is chosen in such a method that it wraps all 2-hop nodes.…”

Section: Minthmentioning

confidence: 99%

Congestion Free Routing in Adhoc Networks

O.¹

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:A Mobile Ad-Hoc Network (MANET) is a temporary network; the mobile devices in an ad-hoc network are communicating through wireless links without any pre-existing infrastructure. The one major problem of this network is network congestion, it may take place at any intermediate nodes when data packets are traveling from source to destination. The major problems of congestion or high data loss, increasing End to End and retransmission packets which affects the overall network performance. The main goal of congestion control is to effectively utilize the existing network resources and maintain the network load below the capacity. Approach: This study presents the Congestion Free Routing in Adhoc networks (CFR), based on dynamically estimated mechanism to monitor network congestion by calculating the average queue length at the node level. While using the average queue length, the nodes' congestion status divided into the three zones (safe zone, likely to be congested zone and congested zone). CFR utilizes the non-congested neighbors and initiates route discovery mechanism to discover a congestion free route between source and destination. This path becomes a core path between source and destination. To maintain the congestion free status, the nodes which are helping data packet transmission periodically calculate their congestion status at the node level. When a core node is noticed that it fell in to likely to congested zone and alerts to its neighbors. The predecessor core path node is aware of this situation and initiates an alternate path discovery mechanism to a destination. Finally it discovers a new congestion free route to the destination. Results: The assessment between CFR and AODV was conducted by using the Ns-2 simulator. The simulation results confirmed that the CFR improved packet delivery ratio, reduction of End to End delay and control packets. Conclusion: Our proposed technique solved the congestion problems in a network.

show abstract

Extended multipoint relays to determine connected dominating sets in MANETs

Cited by 108 publications

References 22 publications

Shared MPR Sets for Moderately Dense Wireless Multihop Networks

Shared MPR Sets for Moderately Dense Wireless Multihop Networks

An energy efficient MCDS construction algorithm for wireless sensor networks

Congestion Free Routing in Adhoc Networks

Contact Info

Product

Resources

About