Traffic Allocation in Delay-Tolerant Wireless Ad Hoc Networks

Park, Min Kyoung; Rodoplu, Volkan

doi:10.1109/wts.2006.334535

Cited by 2 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We evaluated the performance of the resource discovery architecture AMHC against some well known algorithms using NS-2 simulation with the following parameters: network size between 100 and 1000 nodes, network coverage area 350×350 m, node speed between 1 and 50 km/h using random mobility model, node transmission range from 30 to 300 m and simulation duration 15 min without pause. The AMHC performance is measured against three clustering algorithms, Lowest-ID Algorithm (Ephremides et al, 1987), Maximum Connectivity Clustering (MCC) (Parekh, 1994) and the Max-Min Clustering Algorithm (Amis et al, 2000).…”

Section: Resultsmentioning

confidence: 99%

“…A number of clustering algorithms have been proposed in literature such as Linked Cluster Algorithm (LCA) (Baker and Ephremides, 1981), Lowest-ID Algorithm (Ephremides et al, 1987), Maximum Connectivity Clustering (MCC) (Parekh, 1994), Max-Min Clustering Algorithm (Amis et al, 2000), Mobility-Based metric for Clustering (MOBIC) (Basu et al, 2001) and Mobility-based d-Hop Clustering Algorithm (MobDhop) (Er and Seah, 2006).…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

AMHC: Adaptive Multi-Hop Clustering based Resource Discovery Architecture for Large Scale MANETs

Al-Ahmadi¹,

Al-Dhelaan²

2014

RJASET

View full text Add to dashboard Cite

In this study we propose an efficient clustering protocol called AMHC used for resource discovery in large scale Mobile Ad hoc Networks (MANETs). AMHC is an Adaptive Multi-Hop Clustering generating several non-overlapping network localities (clusters) with explicit elected cluster-heads. Every cluster member is on average d hops away from its cluster-head, where d is an integer parameter for the protocol. The generated set of clusters are highly stable and has low restructuring frequency that takes into consideration the dynamic network topology due to nodes mobility and depleted energy. The head election process is a distributed process based on a node's weight formula calculated by every node independently. The node's weight involves the current energy level, the current neighborhood degree and distance (in number of hops) between the nominated head and the voting node. The cluster-head is responsible of coordinating intra-cluster and inter-cluster resource discovery activities. Inter-cluster communication is handled through gateway nodes which hear from more than one cluster and able to connect clusters with each other. The aim of AMHC is to identify all the possible gateways for creating highly fault-tolerant architecture. AMHC is an asynchronous, scalable and robust architecture capable of handling large amount of resource queries with high degree of power and communication efficiency. We conducted a comparative study using simulation to demonstrate AMHC's efficiency and superiority against other recently proposed clustering algorithms in the literature. The comparison is based on: number of generated clusters, average cluster size, cluster stability and nodes re-affiliation. These results show a lot of promise for AMHC as efficient, energy-aware, load-balance and fault tolerant resource discovery architecture for large-scale MANETs.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

AMHC: Adaptive Multi-Hop Clustering based Resource Discovery Architecture for Large Scale MANETs

Al-Ahmadi¹,

Al-Dhelaan²

2014

RJASET

View full text Add to dashboard Cite

show abstract

“…Delay tolerant networks in general have been the subject of a wide range of research [1,2,7,10,11,14,[16][17][18][19][20]. Among those, a set of papers have focused on the routing problems [16,[18][19][20].…”

Section: Related Workmentioning

confidence: 99%

Congestion Management in Delay Tolerant Networks

Zhang¹,

Liu²

2008

Proceedings of the 4th International ICST Conference on Wireless Internet

View full text Add to dashboard Cite

Abstract-In delay tolerant networks, custody transfer can provide certain degree of reliability as a custodian node cannot discard a message unless its life time expires or the custody is transferred to another node after a commitment. This creates a challenging decision making problem at a node in determining whether to accept a custody transfer: on one hand, it is beneficial to accept a large number of messages as it can potentially advance the messages toward their ultimate destinations and network utilization can be maximized; on the other hand, if the receiving node overcommits itself by accepting too many messages, it may find itself setting aside an excessive amount of storage and thereby preventing itself from receiving further potentially important, high yield (in terms of network utilization) messages. To solve this problem, in this paper, we apply the concept of revenue management, and employ dynamic programming to develop a congestion management strategy for delay tolerant networks. For a class of network utility functions, we show that the optimal solution is completely distributed in nature where only the local information such as available storage space of a node is required. This is particularly important given the nature of delay tolerant networks where global information is often not available and the network is inherently dynamic. Our simulation results show that the proposed congestion management scheme is effective in avoiding congestion and balancing network load among the nodes.

show abstract

Traffic Allocation in Delay-Tolerant Wireless Ad Hoc Networks

Cited by 2 publications

References 13 publications

AMHC: Adaptive Multi-Hop Clustering based Resource Discovery Architecture for Large Scale MANETs

AMHC: Adaptive Multi-Hop Clustering based Resource Discovery Architecture for Large Scale MANETs

Congestion Management in Delay Tolerant Networks

Contact Info

Product

Resources

About