Cart (Loading....) | Create Account
Close category search window
 

User-dependent perfect-scheduling multiple access (UPMA) protocol in wireless multihop mobile ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kai Liu ; Nat. Key Lab., Xidian Univ., Xi''an, China ; Jiandong Li ; Wenzhu Zhang

Based on the idea of contention reservation and polling, a user-dependent perfect-scheduling multiple access (UPMA) protocol for supporting node mobility and multihop architecture is described. In the protocol, only the nodes have packets to send contend to use the channel and the nodes without traffic transmission are immediately deleted from the polling list, thus it improves channel utilization greatly. Moreover, a collision avoidance and resolution protocol is proposed to guarantee a node to access the channel rapidly. Finally, taking a wireless network with star topology as an example, the network performance of Internet data traffic is simulated and related conclusions are given.

Published in:

Vehicular Technology Conference, 2002. VTC Spring 2002. IEEE 55th  (Volume:1 )

Date of Conference:

2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.