Reliable Local Recovery in Ad Hoc Wireless Networks
スポンサーリンク
概要
- 論文の詳細を見る
Route failure occurs frequently in ad hoc networks due to unstable link state and node movement. Local recovery mechanism has been widely considered to be more efficient than global recovery for route maintenance in ad hoc networks. Local recovery mechanism takes advantage of local connectivity, and utilizes neighbor nodes of a broken link to relay the packets over disconnected nodes, thus reducing control overhead and average time delay. However, in the existing local recovery protocols, the quality of relay nodes is not considered; if the relay nodes move away from the upstream or downstream node of the broken link soon after the recovery, another route failure occurs and network performance will be unavoidably degraded. In this paper, we seek to enhance the reliability of local recovery through intensive consideration of the quality of relay nodes. In our proposed SR (Smart Relay) protocol, all potential relay candidates are classified into qualified-candidates and nonqualified-candidates, and only qualified-candidates are able to serve as Relay Nodes to recover broken links. The classification is achieved by applying the widely used machine learning approach Support Vector Machine (SVM). In this way, we consider the quality of the shortening link in a sophisticated manner to improve the reliability of local recovery without introducing any extra control overhead. The simulations results confirm that our proposal achieves performance improvement compared to AODV and RELREC.
- 一般社団法人電子情報通信学会の論文
- 2012-12-06
著者
-
Wakahara Yasushi
Information Technology Center The University Of Tokyo
-
Liang Zilu
Graduate School Of Engineering The University Of Tokyo
関連論文
- Fast and low-overhead local route recovery in ad hoc wireless network (ネットワークシステム)
- BS-7-24 Automatic Route Recovery Based on Relay Nodes in Wireless Ad Hoc Networks(BS-7. Network Planning, Control and Management)
- BS-4-16 Incorporating Route Recovery Information to Gossip Routing in Wireless Ad Hoc Networks(BS-4. Network Design, Management and Control for Future Networked Systems)
- Optimal time slot assignment for wireless ad hoc networks with directed links (情報ネットワーク)
- Direction-Aware Time Slot Assignment for Largest Bandwidth in Slotted Wireless Ad Hoc Networks
- Time Slot Assignment in a CDMA/TDMA Ad Hoc Network
- Fast and low-overhead local route recovery in ad hoc wireless network (ネットワークシステム)
- BS-8-1 Automatic Route Shortening Based on Supportive Vector Machine in Wireless Ad Hoc Networks
- Optimization of Handover Plans to Minimize the Degradation of Communications QoS for LEO Satellite Systems(Network Control and Management)(Assurance Systems and Networks)
- BS-12-9 MB-DSR: A New Routing Protocol for Maximum Bandwidth in Slotted Wireless Ad Hoc Networks(BS-12. Network Planning, Control, and Management)
- BS-3-40 Applying Support Vector Machine to Automatic Route Shortening in Wireless Ad Hoc Networks(BS-3. Management and Control Technologies for Innovative Networks)
- BS-5-16 A New Intelligent Transport System for Traffic Congestion Management(BS-5. Network and Service Design, Control and Management)
- BS-5-28 SMHP : an IEEE 802.11 Based MAC Protocol for Solving the Throughput Problem of a Multi-Hop Wireless Network(BS-5. Network and Service Design, Control and Management)
- Reliable Local Recovery in Ad Hoc Wireless Networks
- BS-1-42 Investigation on the Performance of Route Guidance Systems with Imperfect Input
- BS-7-37 Urban Traffic Prediction based on Spatio-Temporal Correlation
- Real Time Traffic Prediction in Urban Traffic Networks