Localized algorithms in wireless ad-hoc networks

Meguerdichian, Seapahn; Slijepcevic, Sasa; Karayan, Vahag; Potkonjak, Miodrag

doi:10.1145/501416.501432

Cited by 149 publications

(92 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this paper, we have shown the advantage that this knowledge can provide when determining routes. Many researchers have considered sensor management from a variety of perspectives [13] [14] [15] [16]. Limited energy resources are typically considered the primary design constraint for wireless sensor networks.…”

Section: Related Workmentioning

confidence: 99%

Providing application QoS through intelligent sensor management

Perillo

Heinzelman

Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.

View full text Add to dashboard Cite

Abstract-Wireless sensor networks are uniquely characterized by tight energy and bandwidth constraints. These networks should be designed to provide enough data to their application so that a reliable description of the environment can be derived, while operating as energy-efficiently as possible and at the same time meeting bandwidth constraints. These goals are typically contradicting and must be balanced at the point where the application is best satisfied. In this paper, we address the problem of maximizing lifetime for a wireless sensor network while meeting a minimum level of reliability. This maximization is achieved by jointly scheduling active sensor sets and finding paths for data routing. Simulation results show that network lifetime can be significantly increased through such methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Providing application QoS through intelligent sensor management

Perillo

Heinzelman

Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.

View full text Add to dashboard Cite

show abstract

“…In these networks every node transmits to the base station directly. This communication implies not only to be too expensive in terms of energy consumption, but it is also infeasible because nodes have limited transmission range [6], [7], [8]. Most of the nodes in networks with large area coverage usually are far enough thus their transmissions cannot reach the base station.…”

Section:  One Hop Modelmentioning

confidence: 99%

Review on Clustering and Data Aggregation in Wireless Sensor Network

Mann¹,

Kumar²

2014

IJCATR

View full text Add to dashboard Cite

Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I summarize and conclude the paper with some future directions.

show abstract

“…We also assume that all nodes are aware of their locations, e.g., through GPS receivers, or by employing a distributed location discovery algorithm, such as in [18]. Each node also knows the locations of its neighbours via a simple Hello protocol.…”

Section: A Network Modelmentioning

confidence: 99%

Efficient geocasting to multiple regions in large-scale wireless sensor networks

Truong

Römer

2012

37th Annual IEEE Conference on Local Computer Networks

View full text Add to dashboard Cite

Abstract-Recently, large sensor networks with several thousands of nodes are being deployed over large geographic areas in the context of smart city projects. In these settings, there is often a need to send a message to all sensors contained in one of multiple geographic regions, for example, to query for a free parking spot in several streets. We present Recursive Multiregion Geocasting (RMG), a novel multi-region geocast routing protocol which addresses the problem of delivering data from a source to multiple remote geocast regions in large-scale wireless sensor networks. The key idea is to treat a remote group of geocast regions as a point destination and forward data packets along a straight line towards the group, until a division point at which the group is divided, and the packet is forwarded towards the sub-groups in the same fashion. RMG is lightweight as no state has to be maintained at the nodes and the computations are simple. Simulation shows that our protocol achieves lower path length overhead and network relay load while incurring less computation overhead when compared to state-of-the-art protocols.

show abstract

Localized algorithms in wireless ad-hoc networks

Cited by 149 publications

References 0 publications

Providing application QoS through intelligent sensor management

Providing application QoS through intelligent sensor management

Review on Clustering and Data Aggregation in Wireless Sensor Network

Efficient geocasting to multiple regions in large-scale wireless sensor networks

Contact Info

Product

Resources

About