T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. SPEED: A stateless protocol for real-time communication in sensor networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS '03), pages 46--55, Washington, DC, USA, 2003. IEEE Computer Society.  Home/Search   Document Details and Download   Summary   Related Articles   Check

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher, "SPEED: A stateless protocol for real-time communication in sensor networks," In Proc. of the 23rd International Confernece on Distributed Computing Systems (ICDCS-23), Providence, RI, USA, May 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. SPEED: A Stateless Protocol for Real-Time Communication in Ad Hoc Sensor Networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems, Providence, RI, 2003.

No context found.

T. He et al., "Speed: A stateless protocol for real-time communication in sensor networks," in Intl. Conf. on Distributed Computing Systems (ICDCS 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. SPEED: A Stateless Protocol for Real-Time Communication in Ad Hoc Sensor Networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems, Providence, RI, 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. SPEED: A Stateless Protocol for Real-time Communication in Sensor Networks. In ICDCS, 2003.

....Forwarding [12] uses greedy forwarding to forward packets to the neighboring node that is closest to the final destination. GF began the trend in pure location based routing and has since seen extensions for handling voids [13] supporting real time traffic [16] and coping with congestion [8]. An important contribution of GF based solutions was the removed requirement that a protocol maintain a global view of the network (i.e. end to end routing tables) GF therefore reduces communication overhead by eliminating its dependence on network wide state information. However, GF based ....

....that the use of additional power saving mechanisms add complexity in the form of state transitions, making our non deterministic algorithm even more appropriate. At the network layer, energy conserving protocols, applicable to WSNs, include an extension to Directed Diffusion [7] 22] and SPEED [8]. While working to power down the radio or disperse traffic for distributed power consumption throughout the network, these protocols create significant communication overhead and latency when nodes freely transition into and out of dormant states. In addition, several protocols (SPAN [4] GAF ....

[Article contains additional citation context not shown here]

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher. "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks," In International Conference on Distributed Computing Systems (ICDCS 2003.

....areamulticast and real time area anycast, along with a traditional real time unicast service. Those new communication semantics are fit seamlessly for the purpose of sensor networks where the location of the data instead of sensor ID is more of interest to the applications. Simulation experiments [40] shows that SPEED can achieve significantly lower deadline miss ratio than geographic routing [58] DSR [53] and AODV [80] in face of sudden congestion. Meanwhile, the control overhead of SPEED is comparable to geographic routing and significantly smaller than DSR and AODV. SPEED demonstrates that ....

....a group based detection . Precise location reports about intruders through node localization 15 4.3 Current Status and Future Plan We expect to complete this PH.D research in about one year. A detailed survey on state of arts are provide in appendix A. Results from three ongoing topics SPEED[40], AIDA [38] and APIT [39] have be refined for conference and journal publication, and two new topics on robust data delivery (IGF [18] and differentiated sensing coverage [97] have been submitted for conference publications (appendix B) Code bases for those protocols are also available online. ....

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher, "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks", In Proceedings of International Conference on Distributed Computing Systems (ICDCS 2003.

....taken place at Berkeley [ 14] 30] 32] and various other research institutions [24] throughout the world. Using such hardware as a basis for development, the software architecture and communication stack residing on these devices has prompted prolific research in the areas of ad hoc networking [10][15] 17] 20] data aggregation [16] 21] 26] cluster formation [25] distributed services [22] group formation [6] channel contention [3] 5] 7] 19] power conservation [4] 12] and much more. Work on the utility of such an innovative technology has unearthed potential applications including ....

Tian He, John A. Stankovic, Chenyang Lu, and Tarek F. Abdelzaher, "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks", In International Conference on Distributed Computing Systems (ICDCS 2003.

....velocities. An application can choose a velocity level for each message. The network guarantees that the chosen message velocity is observed with a very high probability as long as the message is accepted from the application. A network layer protocol with the above property, called SPEED [13], has recently been developed by the authors. The protocol defines the velocity of an in transit message as the rate of decrease of its straightline distance to its final destination. Hence, for example, if the message is forwarded away from the destination, its velocity at that hop is negative. ....

....(non congested) path towards the destination, or the source is reached and informed to slow down. The mentioned scheme is therefore effective in exerting congestion control and performing packet rerouting that guarantee the satisfaction of all velocity constraints in the network at steady state [13]. The protocol is of great value to real time applications where different latency bounds must be associated with messages of different priority. 2.3 Entity Aware Transport Although RAP and SPEED allow velocity constraints to be met, the abstractions provided by them are too low level for ....

T. He, J. Stankovic, C. Lu, and T. Abdelzaher. Speed: A stateless protocol for real-time communication in sensor networks. In International Conference on Distributed Computing Systems, Providence, Rhode Island, May 2003.

....Forwarding [12] uses greedy forwarding to forward packets to the neighboring node that is closest to the final destination. GF began the trend in pure location based routing and has since seen extensions for handling voids [13] supporting real time traffic [16] and coping with congestion [8]. An important contribution of GF based solutions was the removed requirement that a protocol maintain a global view of the network (i.e. end to end routing tables) GF therefore reduces communication overhead by eliminating its dependence on network wide state information. However, GF based ....

....that the use of additional power saving mechanisms add complexity in the form of state transitions, making our non deterministic algorithm even more appropriate. At the network layer, energy conserving protocols, applicable to WSNs, include an extension to Directed Diffusion [7] 22] and SPEED [8]. While working to power down the radio or disperse traffic for distributed power consumption throughout the network, these protocols create significant communication overhead and latency when nodes freely transition into and out of dormant states. In addition, several protocols (SPAN [4] GAF ....

[Article contains additional citation context not shown here]

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher. "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks," In International Conference on Distributed Computing Systems (ICDCS 2003.

....nodes. We argue that unbalanced energy dissipation causes some nodes to die much faster than others do, therefore, the half life of the network will be dramatically reduced in the un balanced approach. Research has addressed energy balance issue from different aspects of sensor networks. SPEED [8] balances the traffic by non deterministically forwarding the packet through multiple routes. GAF [24] performs leader rotation among the nodes inside a virtual grid, in order to balance energy consumption. Research on network topologies control addresses the problem of providing communication ....

....multiple routes. GAF [24] performs leader rotation among the nodes inside a virtual grid, in order to balance energy consumption. Research on network topologies control addresses the problem of providing communication coverage within an energy conservation context such as SPAN [3] LEACH [8] and GAF [24] to name a few. These have a similar flavor as the surveillance coverage problem. For example, LEACH [8] partitions a network into clusters and randomly rotates the cluster leader in order to evenly distribute the energy consumption among the sensors. SPAN [3] is another ....

[Article contains additional citation context not shown here]

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher, SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks, International Conference on Distributed Computing Systems (ICDCS 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. SPEED: A stateless protocol for real-time communication in sensor networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS '03), pages 46--55, Washington, DC, USA, 2003. IEEE Computer Society.

No context found.

Tian He, John A Stankovic, Chenyang Lu, and Tarek Abdelzaher. SPEED: A stateless protocol for real-time communication in sensor networks. International Conference on Distributed Computing Systems(ICDCS 2003.

No context found.

Tian He, John A Stankovic, Chenyang Lu, and Tarek Abdelzaher. SPEED: A stateless protocol for realtime communication in sensor networks. International Conference on Distributed Computing Systems(ICDCS 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher, "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks," in Proceedings of International Conference on Distributed Computing Systems (ICDCS'03), May, 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher, "SPEED: A stateless protocol for real-time communication in sensor networks," in Proc. Intl. Conf. Distributed Computing Systems, Providence, RI, May 2003.

No context found.

T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher, "SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks.". In International Conference on Distributed Computing Systems (ICDCS 2003).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC