Premium
HSG‐ ad hoc network: A novel hierarchical star graph ad hoc network with self‐organization and routing discovery free
Author(s) -
Su TungShih,
Jeng WeiLun,
Huang JengYi,
Hsieh WenShyong
Publication year - 2010
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1091
Subject(s) - computer science , computer network , wireless ad hoc network , optimized link state routing protocol , ad hoc on demand distance vector routing , destination sequenced distance vector routing , mobile ad hoc network , ad hoc wireless distribution service , vehicular ad hoc network , routing protocol , distributed computing , dynamic source routing , network packet , wireless , telecommunications
In ad hoc wireless networks, most data are delivered by multi‐hop routing (hop by hop). This approach may cause long delay and a high routing overhead regardless of which routing protocol is used. To mitigate this inherent characteristic, this work presents a novel ad hoc network structure that adopts dual‐card‐mode, self‐organization with specific IP naming and channel assignment to form a hierarchical star graph ad hoc network (HSG‐ ad hoc ). This network not only expedites data transmission but also eliminates the route discovery procedure during data transmission. Therefore, the overall network reliability and stability are significantly improved. Simulation results show that the proposed approach achieves substantial improvements over DSDV, AODV, and DSR in terms of average end‐to‐end delay, throughput, and packet delivery ratio. Copyright © 2009 John Wiley & Sons, Ltd.