Max-min d-cluster formation in wireless ad hoc networks

Amis, A.D.; Prakash, Ravi; Vuong, Tan Hoa; Huynh, Dung T.

doi:10.1109/infcom.2000.832171

Cited by 728 publications

(587 citation statements)

References 12 publications

Supporting

Mentioning

553

Contrasting

Unclassified

Order By: Relevance

“…In [9], the authors generalized DMAC as G-DMAC, where a new node that joins the cluster head with the highest weight in its one-hop neighborhood (like DMAC). The topology is changeable but the node is still considered as member of this cluster head v as long as there is no other neighboring cluster head u with weight w(u) > w(h) + h, given the parameter h ≥ 0.…”

Section: Related Workmentioning

confidence: 99%

EM-SEP: An efficient modified stable election protocol

Malluh

Elleithy

Qawaqneh

et al. 2014

Proceedings of the 2014 Zone 1 Conference of the American Society for Engineering Education

View full text Add to dashboard Cite

Abstract-Recently wireless sensor networks (WSN) became an interesting topic because of its increasing usage in many fields; medical systems, environment monitoring, military applications and video surveillance. Usually sensors are placed in the desired locations to gather information frequently and then transfer it to the observers. WSN consists of a collection of application specific sensors, a wireless transceiver and a simple general purpose processor. In heterogeneous wireless sensor network, researchers found many challenging issues including the limited energy, the efficient usage of the energy, and the problem with the hierarchy of the network as imbalance network. Many studies indicated that the node clustering is a promising solution for such issues. Clustering has been shown to increase the efficacy of the energy consumption where clusters are formed dynamically with neighboring sensors and the power is assumed to be distributed equally among nodes. One of the nodes is considered as the cluster head that is responsible for transferring data among the neighboring sensors. In this work, we propose a modification based on SEP protocol. EM-SEP aims to prolong the stable period of the sensor network by maintaining balanced energy consumption. This means that we choose the advanced nodes to become cluster heads more often than the normal nodes as the case with SEP protocol. Furthermore, EM-SEP takes in account the number of nodes that are associated with each cluster head. Another important enhancement of EM-SEP protocol that if there are more than one sensor available to be a cluster head at certain round, we choose the sensor with highest energy.

show abstract

Section: Related Workmentioning

confidence: 99%

EM-SEP: An efficient modified stable election protocol

Malluh

Elleithy

Qawaqneh

et al. 2014

Proceedings of the 2014 Zone 1 Conference of the American Society for Engineering Education

View full text Add to dashboard Cite

show abstract

“…There are many clustering algorithms [4], [7], [8], [9] proposed in the literature but unlike these studies, DAWC is neither periodical clustering procedure nor the cluster size is fixed in terms of hops. It adapts according to the dynamic topology of the sensor and actor networks.…”

Section: Hierarchical Configuration Of Sensor Nodesmentioning

confidence: 99%

Real-Time Coordination and Routing in Wireless Sensor and Actor Networks

Shah

Bozyiğit

Akan

et al. 2006

Next Generation Teletraffic and Wired/Wireless Advanced Networking

View full text Add to dashboard Cite

Abstract. In Wireless Sensor Actor Networks (WSAN), sensor nodes perform the sensing task and actor nodes take action based on the sensed phenomena in the field. To ensure efficient and accurate operations of WSAN, new communication protocols are imperative to provide sensoractor coordination in order to achieve energy-efficient and reliable communication. Moreover, the protocols must honor the application-specific real-time delay bounds for the effectiveness of the actors in WSAN.In this paper, we propose a new real-time coordination and routing (RCR) framework for WSAN. It addresses the issues of coordination among sensors and actors and honors the delay bound for routing in distributed manner. RCR configures sensors to form hierarchical clusters and provides delay-constrained energy aware routing (DEAR) mechanism. It uses only cluster-heads to coordinate with sink/actors in order to save the precious energy resources. The DEAR algorithm integrates the forwardtracking and backtracking routing approaches to establish paths from source nodes to sink/actors. In the presence of the sink in WSAN, it implements the centralized version of DEAR (C-DEAR) to coordinate with the actors through the sink. In the absence of sink or ignoring its presence, there is a distributed DEAR (D-DEAR) to provide coordination among sensors and actors. Cluster-heads then select the path among multiple alternative paths to deliver the packets to the actors within the given delay bound in an efficient way. Simulation experiments prove that RCR achieves the goal to honor the realistic application-specific delay bound.

show abstract

“…1(b)). A localized algorithm for building d-dominating sets is proposed by Amis et al [12], who also show that the problem of computing the minimum d-hop dominating set is NP-complete for unit-disk graphs.…”

Section: Related Workmentioning

confidence: 99%

Improving route discovery in on-demand routing protocols using two-hop connected dominating sets

Spohn

Garcia-Luna-Aceves

2006

Ad Hoc Networks

View full text Add to dashboard Cite

Many signaling or data forwarding operations involve the broadcasting of packets, which incurs considerable collisions in ad hoc networks based on a contention-based channel access protocol. We propose the Three-hop Horizon Pruning (THP) algorithm to compute two-hop connected dominating set (TCDS) using only local topology information (i.e., two-hop neighborhood). Because every node has the two-hop neighborhood information, it is possible to maintain fresh routes to all nodes within two hops. In this situation, a TCDS is ideal for the propagation of route request (RREQ) messages in the route discovery process of on-demand routing protocols. THP is shown to be more efficient than all prior distributed broadcasting mechanisms, when a TCDS is preferred over a connected dominating sets (CDS). Like all other algorithms that depend on local topology information, THP is not reliable when the topology changes frequently, and there is a clear trade-off between reliability and efficiency. We describe and analyze two enhancements to THP that address the lack of reliability of neighbor information. First we adopt a virtual radio range (VR), shorter than the physical radio range (RR), and consider as one-hop neighbors only those nodes within VR (we do not use two different radio ranges, as in prior work, because it can incur additional interference). The gap between VR and RR works as a buffer zone, in which nodes can move without loss of connectivity. Second, upon receiving a broadcast packet, the forwarder list in the packet header is analyzed together with the current information about the local neighborhood. Based on that, a node may decide to broadcast the packet even though it has not been selected as a forwarder. We conduct extensive simulations and show that AODV-THP with these two enhancements attains better performance than AODV in terms of delivery ratio, control overhead, packet collisions, and end-to-end delay.

show abstract

Max-min d-cluster formation in wireless ad hoc networks

Cited by 728 publications

References 12 publications

EM-SEP: An efficient modified stable election protocol

EM-SEP: An efficient modified stable election protocol

Real-Time Coordination and Routing in Wireless Sensor and Actor Networks

Improving route discovery in on-demand routing protocols using two-hop connected dominating sets

Contact Info

Product

Resources

About