Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


akron1159522840.pdf (1.31 MB)

ETD Abstract Container

Abstract Header

CONTOUR GUIDED DISSEMINATION FOR NETWORKED EMBEDDED SYSTEMS

Chu, I-Hsine (Jack)
http://rave.ohiolink.edu/etdc/view?acc_num=akron1159522840

Abstract Details

2006, Master of Science, University of Akron, Electrical Engineering.
The emergence of new devices and technologies for networked embedded computing motivates new platforms for integrated computation, control, communication and coordination. These platforms are based on a large collection of loosely-coupled microcontrollers that communicate over low-power wireless links to achieve systemlevel objectives. The low-power transceiver in each node makes it necessary to propagate messages between non-neighboring nodes over multi-hop routes. Traditional methods for multi-hop communication, on wired networks, rely on unique network identifiers for each node and do not scale well as the number of nodes increases. These methods select one of the available paths between a source and a sink. Extensions to these methods, which are referred to as dissemination methods, have been reported in the sensor networks literature. These extensions are energy efficient and do not rely on network identifiers; however, not all of the available paths between a pair of nodes are fully utilized. This thesis presents a new approach for disseminating called contour guided dissemination. A contour is the union of all the shortest paths between a pair of nodes. When the network topology is regular, it is shown that a contour can be computed using local computations by each node. It is also shown that, despite the availability of multiple paths, it is not possible to effectively utilize the contour by uniformly spreading messages over the available paths. A heuristic that effectively utilizes the contour and simulation results to demonstrate the effectiveness of the contour guided dissemination is presented. The results of this thesis are the first steps towards effectively disseminating data in networked embedded systems with general topologies. These results suggest that some nodes must spread the data to exploit the available paths while other nodes must utilize only one of the desirable paths without spreading the data. Identifying such nodes in systems with general topologies, and integrating contour guided dissemination into system-level protocols are exciting avenues for future research.
Shivakumar Sastry (Advisor)
56 p.
nq; node; CONTOUR; ni; xdif; messages

Recommended Citations

Citations

  • Chu, I.-H. (2006). CONTOUR GUIDED DISSEMINATION FOR NETWORKED EMBEDDED SYSTEMS [Master's thesis, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1159522840

    APA Style (7th edition)

  • Chu, I-Hsine (Jack). CONTOUR GUIDED DISSEMINATION FOR NETWORKED EMBEDDED SYSTEMS. 2006. University of Akron, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=akron1159522840.

    MLA Style (8th edition)

  • Chu, I-Hsine (Jack). "CONTOUR GUIDED DISSEMINATION FOR NETWORKED EMBEDDED SYSTEMS." Master's thesis, University of Akron, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=akron1159522840

    Chicago Manual of Style (17th edition)

akron1159522840
891
© 2006, all rights reserved.
This open access ETD is published by University of Akron and OhioLINK.