|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Beaconless Position-based Routing with Guaranteed Delivery for Wireless Ad hoc and Sensor Networks显示文摘Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery. | CHAWLA Mohit GOEL Nishith KALAICHELVAN Kalai NAYAK Amiya STOJMENOVIC Ivan | 2006 | 自动化学报2006，32，6： | 2 |
| 2 | LaConf:A Localized Address Autoconfiguration Scheme for Wireless Ad Hoc Networks显示文摘We propose a localized address autoconfiguration (LaConf) scheme for wireless ad hoc networks.Address allocation information is maintained on the network border nodes,called addressing agents (AAs),which are locally identified by a geographic routing protocol GFG (Greedy-FACE-Greedy).When a node joins the network,it acquires an address from a neighboring AA (if any exists) by local communication or from the head AA (a geographic extreme AA) by GFG-based multi-hop communication.A Geographic Hash Table (GHT) is adopted for duplicate address detection.Each address is hashed to a unique location in the network field,and the associated assignment information is stored along the face perimeter enclosing that location (in the planar graph).When a node receives an address assignment,it consults with the perimeter nodes around the hash location of the assigned address about any conflicts.AAs detect network partitions and merger locally according to neighborhood change and trigger AA re-selection and network re-configuration (if necessary).We propose to apply a Connected Dominating Set (CDS) to improve the performance.We also evaluate LaConf through simulation using different planar graphs. | Xu Li Yanli Deng Amiya Nayak Ivan Stojmenovic Venkat Narasimhan | 2011 | Tsinghua Science and Technology2011，16，5： | 2 |
| 3 | Connectivity based K- hop clustering in wireless networks显示文摘 | Nocetti F G Gonzalez J S Stojmenovic I | 2003 | Telecommunication System2003，22，14： | 1 |
| 4 | Position-based routing in ad hoc networks显示文摘 | STOJMENOVIC I | 2002 | Communications Magazine IEEE2002，40，7： | 1 |
| 5 | Routing with guaranteed delivery in Ad hoc wireless networks 显示文摘 | BOSE P MORIN P STOJMENOVIC I | 2001 | WirelGSS Network2001，7，6： | 1 |
| 6 | Routing with Guaranteed Delivery in Ad hoc Wireless Networks显示文摘 | Bose P Morin B Stojmenovic I | 2001 | Wireless Networks2001，，7： | 1 |
| 7 | Optimal power allocation and load distribution for multiple heterogeneous multi-core server processors across clouds and data centers显示文摘 | Cao Jun-wei Li Ke-qin and Stojmenovic I | 2014 | IEEE Transactions on Computers2014，63，1： | 1 |
| 8 | Ad Hoc Networks显示文摘 | Wu J Stojmenovic I | | 0，，2： | 1 |
| 9 | Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstruction from its traversals 显示文摘 | Stojmenovic I | 1996 | IEEE Transactions on Parallel and Distributed Systems1996，7，2： | 1 |
| 10 | Localized network layer protocols in sen- sor networks based on optimizing cost over progress ra- tio 显示文摘 | Stojmenovic I | 2006 | IEEE Netw2006，20，1： | 1 |
| 11 | Design Guidelines for Routing Protocols in AdHoc and Sensor Networks with aRealistic Physical Layer显示文摘 | STOJMENOVIC I NAYAK A KURUVILA J | 2005 | IEEE Communications Magazine2005，43，3： | 1 |
| 12 | Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks显示文摘 | Stojmenovic I Lin X | 2001 | IEEE Transactions on Parallel and Distributed Systems2001，12，10： | 1 |
| 13 | Routing with guaranteed delivery in ad hoc wireless networks显示文摘 | Bose P Morin P Stojmenovic I | 2001 | Wireless Networks2001，7，6： | 1 |
| 14 | Preface显示文摘Theory and Applications of Models of Computation (TAMC) is an international conference series with an interdisciplinary character, bringing together researchers working in computer science, mathematics (especially logic) and the physical sciences. This interdisciplinary character with an emphasis on the theory of computation in a broad sense gives the series its special character. | Silvia Giordano Ivan Stojmenovic | 2008 | Journal of Computer Science & Technology2008，23，3： | 1 |
| 15 | Physical layer impact on the design and performance of routing and broadcasting protocols in ad hoc and sensor networks显示文摘 | Stojmenovic I Nayak A Kuruvila J | 2005 | Computer Communications2005，28，10： | 1 |
| 16 | Power-aware localized routing in wireless networks显示文摘 | STOJMENOVIC I LIN X | 2001 | IEEE Trans on Parallel and Distributed Systems2001，12，11： | 1 |
| 17 | Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehic- ular Ad-hoc Networks显示文摘 | Ros F Ruiz P Stojmenovic | 2012 | IEEE Transactions on Mobile Com- puting2012，11，1： | 1 |
| 18 | Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks显示文摘 | STOJMENOVIC I SEDDIGH M ZUNIC J | 2002 | IEEE Trans on Parallel and Distributed Systems2002，13，1： | 1 |
| 19 | Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks显示文摘 | Stojmenovic I Seddigh S Zunic J | 2002 | IEEE Trans on Parallel and Distributed Systems2002，13，1： | 1 |
| 20 | Power Aware Localized Routing in Wireless Networks 显示文摘 | Stojmenovic I Lin X | 2001 | IEEE Transactions on Parallel and Distributed Systems2001，12，11： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员