ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A real-time message scheduler support for dual-sink mobile ad-hoc sensor networks
Full text PdfPdf (332 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Operating systems track table of contents
Pages: 305-309  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Junghoon Lee  Cheju National University, Jeju-City, Korea
Gyung-Leen Park  Cheju National University, Jeju-City, Korea
Shafqat Rehman  Cheju National University, Jeju-City, Korea
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 78,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529349
What is a DOI?

ABSTRACT

This paper designs and measures the performance of a message scheduling scheme for the mobile sensor network employing two sinks. For the purpose of enhancing the successful delivery ratio for time-sensitive sensor messages and also avoiding congestion around the sinks, the proposed scheme keeps their loads different, and makes each sensor node send the urgent message to the low-load sink. For a neutral node, the urgency of a message is estimated by comparing the slack value of the message and slack distribution of overall messages observed at the node. With this information, each node decides the destination of each message. The simulation performed via ns-2 reveals that the proposed scheme, called chop partition, can improve the deadline meet ratio of real-time messages by up to 7.2% for AODV case and 8.2% for DSDV case, compared with the random selection scheme, or even partition, for the given experiment parameters.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
B. Hull, V. Bychkovsky, Z. Y, K. Chen, M. Goraczko, A. Miu, E. Shih, H. Balakrishnan, and S. Madden. Cartel: A distributed mobile sensor computing system. pages 355--361, 2006.
4
 
5
6
 
7
Microsoft. http://www.microsoft.com/windowsmobile/en-us/default.mspx.
 
8
 
9
IEEE. 802.11-1999. Part 11: Wireless lan medium access control (MAC) and physical layer (PHY) specifications. 1999.
 
10
 
11
I. Chakeres and E. Belding-Royer. AODV routing protocol implementation design. Proceedings of the International Workshop on Wireless Ad Hoc Networking (WWAN), 2004.
 
12
W. Song, F. Yuan, and R. Lahusen. Time-optimum packet scheduling for many-to-one routing in wireless sensor networks. 3rd IEEE Int'l Conference on Mobile Ad-hoc and Sensor Systems, pages 81--90, 2006.
 
13
 
14
J. Lee, M. Kang, Y. Jin, G. Park, and H. Kim. Design of an efficient error control scheme for time-sensitive application on the wireless sensor network based on IEEE 802.11 standard. Lecture Note on Computer Science, LNCS 3741: 355--61, 2005.
15
16
 
17
K. Fall and K. Varadhan. Ns notes and documentation, technical report. VINT project. UC-Berkeley and LBL, 1997.
 
18

Collaborative Colleagues:
Junghoon Lee: colleagues
Gyung-Leen Park: colleagues
Shafqat Rehman: colleagues