Low-power wireless sensor networks

Min, Rex; Bhardwaj, Manish; Cho, SeongHwan; Shih, Eugene; Sinha, A.; Wang, A.; Chandrakasan, Anantha P.

doi:10.1109/icvd.2001.902661

Cited by 267 publications

(110 citation statements)

References 8 publications

Supporting

Mentioning

109

Contrasting

Order By: Relevance

“…Note that node failures can be modeled as a special case of a certain set of link failures. That is, if node v were to fail, this event can be 18 modeled as the failure of all links adjacent to v. Besides link failures, new sensor nodes may be put into the field when there are not enough old nodes available for the application. Or an environmental noise disappeared so a link between two nodes is now available.…”

Section: B Mlsr Under Topology Changementioning

confidence: 99%

See 1 more Smart Citation

Minimum latency joint scheduling and routing in wireless sensor networks

Krishnamachari

2007

Ad Hoc Networks

View full text Add to dashboard Cite

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this paper, we address the important problem of minimizing average communication latency for the active flows while providing energy-efficiency in wireless sensor networks. As the flows in some wireless sensor network can be long-lived and predictable, it is possible to design schedules for sensor nodes so that nodes can wake up only when it is necessary and asleep during other times. Clearly, the routing layer decision is closely coupled to the wakeup/sleep schedule of the sensor nodes.We formulate a joint scheduling and routing problem with the objective of finding the schedules and routes for current active flows with minimum average latency. By constructing a novel delay graph, the problem can be solved optimally by employing the M node-disjoint paths algorithm under FDMA channel model. We further extend the algorithm to handle dynamic traffic changes and topology changes in wireless sensor networks. We also propose a heuristic solution for the minimum latency joint scheduling and routing problem under single channel interference.Numerical results show the latency can reduced 15% under stationary scenario and 50% under dynamic traffic or topology changes.

show abstract

Section: B Mlsr Under Topology Changementioning

confidence: 99%

“…A wireless sensor network (WSN) is a distributed sensing network comprised of thousands, or even tens of thousands small devices that sense, collect and disseminate information about the environment [1], [18], [21].…”

Section: Introductionmentioning

confidence: 99%

Minimum latency joint scheduling and routing in wireless sensor networks

Krishnamachari

2007

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…6. At each stride, the algorithm checks each sensor in the list of nodes that are one hop away from the gateway to check whether the gateway is to get out of the range of that sensor or not (line [3][4][5]. If the gateway is not out of range, it estimates the next intermediate position and sets the transmission range for the last hop node so that the gateway receives the messages uninterruptedly until reaching that intermediate pos ition (line 10).…”

Section: Routing To a Mobile Gatewaymentioning

confidence: 99%

Energy‐aware delay‐constrained routing in wireless sensor networks

Akkaya

Younis

2004

Int J Communication

View full text Add to dashboard Cite

Abstract. Recent years has witnessed a growing interest in the applications of unattended wireless sensor networks. Typically sensors collect data about their surrounding and forward that data to a gateway (sink). Due to the limitation of the energy supply that these miniaturized sensors have, almost all of the proposed routing protocols have aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway. However, many new issues have been posed by the increasing interest in applications that demand certain quality of service (QoS) guarantees. Such issues even get more challenging when the gateway is mobile. In this paper, we propose an energy-aware approach for routing delay-constrained data. The approach pursues multi-hop packet relaying to minimize transmission energy and employs Weighted Fair Queuing (WFQ) packet scheduling methodology along with leaky bucket constrained data sources in order to provide soft real-time guarantees for data delivery. Such employment of WFQ at each node provides a service differentiation between two different classes of traffic, namely real-time and non-real-time traffic and divides the outgoing link capacity among such classes accordingly. In the case of a mobile gateway, uninterrupted data flow for both types of traffic is achieved by dynamic adjustment of the route setup to react to the gateway's departure out of transmission range of relaying nodes. Simulation results demonstrate the effectiveness of the proposed approach for popular performance metrics.

show abstract

“…For any surveillance missions and to detect moving targets, chemical gases, or the presence of micro-agents sensor network and sensor nodes are effective technique. Sensor nodes are probable to be positioned randomly in any desired location uncontrolled manner, such as put down by any fly machine, and to together create a network in ad-hoc behavior [3]. Designing and operating such need large network is required scalable architectural and efficient management.…”

Section: Introductionmentioning

confidence: 99%

WSN Performance Issues and Various Clustering Methods

Modi¹,

Prajapati²

2014

IJCA

View full text Add to dashboard Cite

There are several application have been developed with need of self organization for network. To fulfill this requirement need of wireless sensor network in such applications. To manage network efficiently clustering is used. Lots of works have been done in field of wireless sensor networks (WSNs) in last few years. These researches have boost potential of WSNs in applications such as security monitoring, disaster management, military area, border protection and health monitoring systems. Such applications are required to be remotely deployed sensor nodes in huge numbers and to operate autonomously. So there need to scalability, nodes are often collected into disjoint clusters. This paper, presents a categorization and common organization of available clustering proposal. This work analysis various clustering algorithms used for WSNs and give a review with focusing on their objectives features, etc. and proposed efficient clustering method for stable cluster formation and maintenance.

show abstract

Low-power wireless sensor networks

Cited by 267 publications

References 8 publications

Minimum latency joint scheduling and routing in wireless sensor networks

Minimum latency joint scheduling and routing in wireless sensor networks

Energy‐aware delay‐constrained routing in wireless sensor networks

WSN Performance Issues and Various Clustering Methods

Contact Info

Product

Resources

About