Partition Timing Routing Protocol in Wireless Ad Hoc Networks
Summary :
Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.6 pp.1433-1437
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Human Communication I)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jen-Yi HUANG, Hsi-Han CHEN, Lung-Jen WANG, Chung-Hsien LIN, Wen-Shyong HSIEH, "Partition Timing Routing Protocol in Wireless Ad Hoc Networks" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 6, pp. 1433-1437, June 2004, doi: .
Abstract: Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_6_1433/_p
Copy
@ARTICLE{e87-d_6_1433,
author={Jen-Yi HUANG, Hsi-Han CHEN, Lung-Jen WANG, Chung-Hsien LIN, Wen-Shyong HSIEH, },
journal={IEICE TRANSACTIONS on Information},
title={Partition Timing Routing Protocol in Wireless Ad Hoc Networks},
year={2004},
volume={E87-D},
number={6},
pages={1433-1437},
abstract={Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Partition Timing Routing Protocol in Wireless Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1433
EP - 1437
AU - Jen-Yi HUANG
AU - Hsi-Han CHEN
AU - Lung-Jen WANG
AU - Chung-Hsien LIN
AU - Wen-Shyong HSIEH
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2004
AB - Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.
ER -
English
