無線傳輸技術與許多創新應用的快速發展，讓無線隨意式感測網路(wireless ad hoc and sensor networks, WASN)成為一門熱門的研究領域。本論文探討建構與維護WASN之疊加(overlay)結構的相關研究問題。所謂的疊加結構是在真實網路系統之上的一種邏輯上的網路拓墣，其使用某些架構來連接網路內的一群結點。這些在疊加結構內的邏輯性網路連線，可以通過數個網路中的中介節點。在WASN中，研究者需探討各種疊加結構(例如tree，mesh或cluster)於不同應用的情境(如flooding，gathering, multicasting與lookup等)之下的各種表現與狀況。疊加結構將應用軟體之下的實際網路架構做簡化，將實際網路架構之複雜性、不規則性與一些不穩定的特性，做隱藏、簡化性的描述。關於overlay的建構，我們探討研究在靜態性的WASN上建構ring形式的疊加結構。所謂的ring形式的疊加結構是將網路內的節點用ring將其串起，如同Hamiltonian cycle一樣。在隨意圖形上建構Hamiltonian cycle是非常困難的。我們研究實際的問題，例如可靠性的檔案傳輸，互斥問題與時間同步問題，結果顯示ring架構確實有辦法可以解決上述問題。

我們所提出的ring形式的疊加結構有支援multiple nodes appearance (overlay的路徑可以通過同一節點一次以上。)，同時架構內允許side-path與loop。Ring形式的overlay可以讓節點進行雙向且無碰撞的訊息傳輸，進行節點排序，且提供進行網路操作之後的節點狀況回報，而且這些回報資訊是不需額外訊息成本的。我們探討各種不同的ring形式overlay的分散式建構演算法與其最佳化的相關問題。於overlay的維護上，我們探討於叢集式行動隨意型網路(Cluster-based Mobile ad hoc network, cluster-based MANET)的資源維護相關問題。我們考量使用cluster-head來進行資源管理，我們稱為Cluster-Based With Head Overlay (CWHO)。

使用head node這種方法所會衍生出之某些問題，例如節點失效與hotspot(少數節點流量過高)、資源消耗過高等情況，我們提出了一種完全分散性的資源管理機制，稱為Cluster-Based WithOut Head Overlay (CWOHO)。在CWOHO，我們將所有節點的資源分散到cluster之中，使得每一個節點都可以變成cluster head。CWHO與CWOHO都是進行全面性維護(total maintenance)，每個cluster都可以維護在網路中所有cluster的資訊。此種全面性維護之要求，對於某些訊息傳輸延遲有要求與限制的應用情境，例如多媒體的應用，是種不可或缺的特性。除了此兩種極端性的策略，我們討論第三種維護策略，稱為Clusters with Neighbor Information (CNI)。以上三種策略的表現都有進行評估與比較。

The advancement of wireless technologies and range of innovative applications
made wireless ad hoc and sensor networks (WASN) a very popular research area. This
dissertation considers an interesting research problem of construction and maintenance
of an overlay structure in WASN. An overlay is a logical topology built on top of a
physical network to connect a set of nodes in a certain structure. The logical links of
an overlay structure can pass through number of intermediate nodes in the network.
In WASN, researchers have studied various overlay structures, such as tree, mesh,
clusters overlay, for performing applications such as flooding, gathering, multicasting
and lookups. An overlay acts as an abstraction to hide the complexity, irregularity,
and dynamics in the underlying network from the applications running on top of it.
In overlay construction, we study an innovative technique for constructing ringlike
overlays on static wireless ad hoc and sensor networks. A ring-like overlay is
a ring structure that connects a group of nodes in the network, as in Hamiltonian
cycle. Building a Hamiltonian cycle over a random graph is very difficult. We
consider practical problems such as reliable file transfer, mutual exclusion, and clock
synchronization, and find that a relaxed ring structure is sufficient to solve these
problems. Our proposed ring-like overlay supports multiple nodes appearances, i.e.,
the overlay path can pass through a node more than once. It also allows side-paths and
loops in its structure. A ring-like overlay allows conflict-free two-way communications,
supports node ordering, and provides cost-free status feedbacks of operations. We
discuss a number of distributed construction algorithms for ring-like overlays, which
optimizes a different aspect of the overlay.
In overlay maintenance, we consider the design space of the resources maintenance
problem in a cluster-based mobile ad hoc network (MANET). On one end, we consider
the strategy of using cluster heads for maintaining resources of the clusters, referred
as Cluster-Based With Head Overlay (CWHO). To address the problem associated
with the head nodes, such as single point failure, hot-spot, excess power consumption,
we investigate the other extreme of the design space and propose a fully distributed
strategy for resource maintenance, referred as Cluster-Based WithOut Head Overlay
(CWOHO). In CWOHO, we distribute the resources to all nodes in the cluster, so
that every node can play the role of the cluster heads. Both CWHO and CWOHO
deals with total maintenance, i.e., every cluster maintains the resource information of
all other clusters in the network, which can be essential for the delay constrained or
multimedia applications. In the middle of the two extremes, we investigate a third
maintenance strategy, referred as Clusters with Neighbor Information (CNI). The
performance of the three strategies is evaluated and compared.

[1] Z. J. Haas and S. Tabrizi, “On Some Challenges and Design Choices in Ad-
Hoc Communications,” in Proceedings of the IEEE Military Communications
Conference, (MILCOM 98), vol. 1, pp. 187–192, Oct 1998. 1
[2] J. Jubin and J. D. Tornow, “The DARPA Packet Radio Network Protocols,” in
Proceedings of the IEEE, vol. 75, pp. 21–32, Jan. 1987. 1
[3] “Mobile Ad Hoc Networks (MANET).” Internet Engineering Task Force (IETF).
1
[4] G.Wang, G. Cao, P. Berman, and T. La Porta, “Bidding Protocols for Deploying
Mobile Sensors,” IEEE Transactions on Mobile Computing, vol. 6, pp. 515–528,
May 2007. 2
[5] W. Wang, V. Srinivasan, and K.-C. Chua, “Coverage in Hybrid Mobile Sensor
Networks,” IEEE Transactions on Mobile Computing, vol. 7, pp. 1374–1387,
Nov. 2008. 2
[6] K. Lynch, I. Schwartz, P. Yang, and R. Freeman, “Decentralized Environmental
Modeling by Mobile Sensor Networks,” IEEE Transactions on Robotics, vol. 24,
pp. 710–724, June 2008. 2
[7] J. Lu and T. Suda, “Differentiated Surveillance for Static and Random Mobile
Sensor Networks,” IEEE Transactions on Wireless Communications, vol. 7,
pp. 4411–4423, November 2008. 2
[8] D. Wang, J. Liu, and Q. Zhang, “Mobility-Assisted Sensor Networking for
Field Coverage,” in Proceedings of IEEE Global Telecommunications Conference
(GLOBECOM ’07), pp. 1190–1194, Nov. 2007. 2
[9] Y. Tang, B. Birch, and L. Parker, “Planning Mobile Sensor Net Deployment for
Navigationally-Challenged Sensor Nodes,” in Proceedings of IEEE International
123
BIBLIOGRAPHY
Conference on Robotics and Automation (ICRA’04), vol. 1, pp. 172–179 Vol.1,
April-1 May 2004. 2
[10] S. Guo and O. Yang, “A Dynamic Multicast Tree Reconstruction Algorithm
for Minimum-Energy Multicasting in Wireless Ad Hoc Networks,” in
Proceedings of IEEE International Conference on Performance, Computing, and
Communications, 2004, pp. 637–642, 2004. 5
[11] S. Kim and S. Kim, “A Energy Conservation Scheme to Maintain Data
Aggregation Tree in Sensor Networks,” in Proceedings of Asia-Pacific Conference
on Communications, 2005, pp. 367–370, Oct. 2005. 5
[12] C.-K. Toh, G. Guichal, and S. Bunchua, “ABAM: On-Demand Associativity-
Based Multicast Routing for Ad Hoc Networks,” in Proceedings of 52nd IEEE
Vehicular Technology Conference (VTC 2000), vol. 3, pp. 987–993, Sept 2000. 5
[13] J. G. Jetcheva, Adaptive Demand-Driven Multicast Routing in Multi-Hop
Wireless Ad Hoc Networks. PhD thesis, Carnegie Mellon University, Pittsburgh,
PA, USA, 2004. 5
[14] B. Zhou, A. Marshall, and T.-H. Lee, “An Energy-Aware Virtual Backbone
Tree for Wireless Sensor Networks,” in Proceedings of IEEE Global
Telecommunications Conference (GLOBECOM’05), vol. 1, 2005. 5
[15] C.-C. Hu, E. Hsiao-Kuang, and G.-H. Chen, “Bandwidth-Satisfied Multicast
Trees in MANETs,” in Proceedings of IEEE International Conference on Wireless
And Mobile Computing, Networking And Communications (WiMob’2005),
vol. 3, pp. 323–328, Aug. 2005. 5
[16] B.-H. Liu, W.-C. Ke, C.-H. Tsai, and M.-J. Tsai, “Constructing a Message-
Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless
Sensor Networks Is NP-Complete and an Enhanced Data Aggregation
Structure,” IEEE Transactions on Computers, vol. 57, pp. 849–863, June 2008.
5
[17] C. Weng, M. Li, and X. Lu, “Data Aggregation with Multiple Spanning Trees
in Wireless Sensor Networks,” in Proceedings of International Conference on
Embedded Software and Systems (ICESS ’08), pp. 355–362, July 2008. 5
[18] M. Khan, G. Pandurangan, and V. Anil Kumar, “Distributed Algorithms
for Constructing Approximate Minimum Spanning Trees in Wireless Sensor
Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 20,
pp. 124–139, Jan. 2009. 5
124
BIBLIOGRAPHY
[19] S.-Y. Ou, H.-C. Hsiao, C.-K. Chiang, and C.-T. King, “Distributed Overlay
Formation in Heterogeneous Wireless Sensor Networks,” International Journal
of Distributed Sensor Networks, vol. 3, no. 2, pp. 137–150, 2007. 5
[20] Z. Eskandari, M. Yaghmaee, and A. Mohajerzadeh, “Energy Efficient Spanning
Tree for Data Aggregation in Wireless Sensor Networks,” in Proceedings of 17th
International Conference on Computer Communications and Networks, 2008,
(ICCCN ’08), pp. 1–5, Aug. 2008. 5
[21] T. Acharya, S. Chattopadhyay, and R. Roy, “Energy-Aware Virtual Backbone
Tree for Efficient Routing in Wireless Sensor Networks,” in Proceedings of 3rd
International Conference on Networking and Services 2007, (ICNS’07), pp. 96–
96, June 2007. 5
[22] W. L. Lee, A. Datta, and R. Cardell-Oliver, “FlexiTP: A Flexible-Schedule-
Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor
Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 19,
pp. 851–864, June 2008. 5
[23] Sajama and Z. J. Haas, “Independent-Tree Ad Hoc Multicast Routing
(ITAMAR),” Mobile Networks and Applications, vol. 8, no. 5, pp. 551–566, 2003.
5
[24] G. Rodolakis, A. Laouiti, P. Jacquet, and A. Meraihi Naimi, “Multicast Overlay
Spanning Trees in Ad Hoc Networks: Capacity Bounds, Protocol Design and
Performance Evaluation,” Computer Communication, vol. 31, no. 7, pp. 1400–
1412, 2008. 5
[25] W. Wei and A. Zakhor, “Multiple Tree Video Multicast Over Wireless Ad Hoc
Networks,” IEEE Transactions on Circuits and Systems for Video Technology,
vol. 17, pp. 2–15, Jan. 2007. 5
[26] V. Annamalai, S. K. S. Gupta, and L. Schwiebert, “On Tree-Based
Convergecasting in Wireless Sensor Networks,” in Proceedings of IEEE Wireless
Communications and Networking (WCNC 2003), vol. 3, pp. 1942–1947, March
2003. 5
[27] C. Buratti, F. Cuomo, S. Luna, U. Monaco, J. Orriss, and R. Verdone, “Optimum
Tree-Based Topologies for Multi-Sink Wireless Sensor Networks Using IEEE
802.15.4,” in Proceedings of 65th IEEE Vehicular Technology Conference (VTC
2007), pp. 130–134, April 2007. 5
125
BIBLIOGRAPHY
[28] D. Agrawal, T. B. Reddy, and C. S. R. Murthy, “Robust Demand-Driven
Video Multicast over Ad hoc Wireless Networks,” in Proceedings of 3rd
International Conference on Broadband Communications, Networks and Systems
(BROADNETS 2006), pp. 1–10, Oct. 2006. 5
[29] P. Andreou, D. Zeinalipour-Yazti, P. Chrysanthis, and G. Samaras, “Workload-
Aware Query Routing Trees in Wireless Sensor Networks,” in Proceedings of 9th
International Conference on Mobile Data Management (MDM ’08), pp. 189–196,
April 2008. 5
[30] D. Promkotwong and O. Sornil, “A Mesh-Based QoS Aware Multicast Routing
Protocol,” in Proceedings of International Conference on Software Engineering,
Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD
2007), vol. 3, pp. 1046–1051, 30 2007-Aug. 1 2007. 5
[31] R. Inayat, U. Gardezi, and A. Shahid, “Adaptive Mesh Based Routing for
Efficient Multicasting in Highly Mobile Ad Hoc Networks,” in Proceedings of
International Conference on Emerging Technologies (ICET ’06), pp. 493–500,
Nov. 2006. 5
[32] I. I. Er and W. K. G. Seah, “Distributed Steiner-Like Multicast Path Setup
for Mesh-based Multicast Routing in Ad Hoc Networks,” Proceedings of IEEE
International Conference on Sensor Networks, Ubiquitous, and Trustworthy
Computing, vol. 2, pp. 192–197, June 2006. 5
[33] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc
Networks,” in Proceedings of IEEE Wireless Communications and Networking
(WCNC 2003), vol. 2, pp. 1118–1123 vol.2, March 2003. 5
[34] K. Viswanath, K. Obraczka, and G. Tsudik, “Exploring Mesh and Tree-Based
Multicast. Routing Protocols for MANETs,” IEEE Transactions on Mobile
Computing, vol. 5, pp. 28–42, Jan. 2006. 5
[35] P. Sinha, R. Sivakumar, and V. Bharghavan, “MCEDAR: Multicast Core-
Extraction Distributed Ad Hoc Routing,” in Proceedings of IEEE Wireless
Communications and Networking Conference (WCNC 1999), vol. 3, pp. 1313–
1317, 1999. 5, 7, 13, 93, 96
[36] S. Lee and C. Kim, “Neighbor Supporting Ad Hoc Multicast Routing Protocol,”
in Proceedings of 1st Annual Workshop on Mobile and Ad Hoc Networking and
Computing (MobiHOC 2000), pp. 37–44, 2000. 5
126
BIBLIOGRAPHY
[37] R. Menchaca-Mendez and J. Garcia-Luna-Aceves, “Scalable Multicast Routing
in MANETs Using Sender-Initiated Multicast Meshes,” Proceedings of 5th IEEE
International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2008),
pp. 1–12, 29 2008-Oct. 2 2008. 5
[38] C.-T. Kuo and C.-K. Liang, “A Meshed Multipath Routing Protocol in
Mobile Ad Hoc Networks,” in Proceedings of 7th International Conference on
Parallel and Distributed Computing, Applications and Technologies (PDCAT
’06), pp. 306–310, Dec. 2006. 5
[39] G. Xie, M. Swamy, and M. Ahmad, “Joint Optimal Multipath Routing and
Rate Control for Multidescription Coded Video Streaming in Ad Hoc Networks,”
IEEE Transactions on Multimedia, vol. 10, pp. 1687–1697, Dec. 2008. 5
[40] K. Dheerendra Nath Reddy and R. M. Garimella, “Leveled Meshed Multipath
Routing: A Novel Approach,” in Proceedings of IEEE Tencon 2008, (Tencon
2008), pp. 1–6, Nov. 2008. 5
[41] S. De, C. Qiao, and H. Wu, “Meshed Multipath Routing: An Efficient
Strategy in Sensor Networks,” Proceedings of IEEE Wireless Communications
and Networking (WCNC 2003), vol. 3, pp. 1912–1917, March 2003. 5
[42] J. W. Tsai and T. Moors, “Minimum Interference Multipath Routing Using
Multiple Gateways in Wireless Mesh Networks,” in Proceedings of 5th IEEE
International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2008),
pp. 519–520, Oct 2008. 5
[43] N. S. Nandiraju, D. S. Nandiraju, and D. P. Agrawal, “Multipath Routing in
Wireless Mesh Networks,” Proceedings of IEEE International Conference on
Mobile Adhoc and Sensor Systems (MASS 2006), pp. 741–746, Oct. 2006. 5
[44] W. Wang, X. Liu, and D. Krishnaswamy, “Robust Routing and Scheduling in
Wireless Mesh Networks,” in Proceedings of 4th Annual IEEE Communications
Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
(SECON ’07), pp. 471–480, June 2007. 5
[45] S. Mao, S. Lin, S. Panwar, Y. Wang, and E. Celebi, “Video Transport Over Ad
hoc Networks: Multistream Coding with Multipath Transport,” IEEE Journal
on Selected Areas in Communications, vol. 21, pp. 1721–1737, Dec. 2003. 5
[46] C.-Z. Yang, “A token-based h-out of-k distributed mutual exclusion algorithm
for mobile ad hoc networks,” in Proceedings of 3rd International Conference on
127
BIBLIOGRAPHY
Information Technology: Research and Education (ITRE 2005), pp. 73–77, June
2005. 5, 12, 16, 33
[47] J. Walter and S. Kini, “Mutual Exclusion on Multihop, Mobile Wireless
Networks,” tech. rep., Texas A & M University, College Station, TX, USA,
1997. 5, 12, 16, 33
[48] B. Whetten, T. Montgomery, and S. M. Kaplan, “A High Performance
Totally Ordered Multicast Protocol,” in Selected Papers from the International
Workshop on Theory and Practice in Distributed Systems, (London, UK), pp. 33–
57, Springer-Verlag, 1995. 5, 29
[49] I. Stoica, R. Mukkamala, R. Yerraballi, and F. Dobrian, “A simple Ordered and
Reliable Group Multicast Protocol,” in The 8th IASTED-ISMM Conference on
Parallel and Distributed Computing Systems, 1996. 5, 29
[50] J.-M. Chang and N. F. Maxemchuk, “Reliable Broadcast Protocols,” ACM
Transaction Computer System, vol. 2, no. 3, pp. 251–273, 1984. 5, 29
[51] F. Cristian and S. Mishra, “The Pinwheel Asynchronous Atomic Broadcast
Protocols,” in Proceedings 2nd International Symposium on Autonomous
Decentralized Systems (ISADS 95), pp. 215–221, Apr 1995. 5, 29
[52] I. Nikolaidis and J. Harms, “A Logical Ring Reliable Multicast Protocol
for Mobile Nodes,” in Proceedings 7th International Conference on Network
Protocols (ICNP ’99), pp. 106–113, Oct.-3 Nov. 1999. 5, 30
[53] Q. Li and D. Rus, “Global Clock Synchronization in Sensor Networks,” IEEE
Transactions on Computers, vol. 55, no. 2, pp. 214–226, 2006. Member-Li„ Qun
and Member-Rus„ Daniela. 5, 10, 11, 12, 16, 40, 41, 78
[54] A. Reaz, V. Ramamurthi, D. Ghosal, J. Benko, W. Li, S. Dixit, and
B. Mukherjee, “Enhancing Multi-Hop Wireless Mesh Networks with a
Ring Overlay,” in Proceedings of 5th IEEE Annual Communications Society
Conference on Sensor, Mesh and Ad Hoc Communications and Networks
Workshops 2008, (SECON Workshops ’08), pp. 1–6, June 2008. 5
[55] B. Krishnamachari, R. Bejar, and S. Wicker, “Distributed Problem Solving
and the Boundaries of Self-Configuration in Multi-hop Wireless Networks,” in
Proceedings of the 35th Annual Hawaii International Conference on System
Sciences (HICSS’02), (Washington, DC, USA), IEEE Computer Society, 2002.
5, 66
128
BIBLIOGRAPHY
[56] S. Lindsey and C. S. Raghavendra, “PEGASIS: Power Efficient Gathering in
Sensor Information Systems,” in Proceedings IEEE Aerospace Conference, vol. 3,
pp. 1125–1130, 2002. 5, 8, 63, 66
[57] M. Ali and Z. A. Uzmi, “CSN: A Network Protocol for Serving Dynamic
Queries in Large-Scale Wireless Sensor Networks,” in Proceedings of 2nd Annual
Conference on Communication Networks and Services Research (CNSR’04),
pp. 165–174, May 2004. 5, 66
[58] S. C. Huang, R. H. Jan, and W. Yang, “RICA: A Ring-Based Information
Collection Architecture in Wireless Sensor Networks,” International Journal of
Sensor Networks (IJSNet), vol. 1, no. 3/4, pp. 190 –199, 2006. 5, 6, 8, 63, 66
[59] M. Caesar, M. Castro, E. B. Nightingale, G. O’Shea, and A. Rowstron, “Virtual
Ring Routing: Network Routing Inspired by DHTs,” in Proceedings ACM
SIGCOMM, pp. 351–362, 2006. 5, 6, 66
[60] F. Delmastro, “From Pastry to CrossROAD: CROSS-Layer Ring Overlay for
AD Hoc Networks,” in Proceedings of the Third IEEE International Conference
on Pervasive Computing and Communications Workshops (PERCOMW ’05),
(Washington, DC, USA), pp. 60–64, IEEE Computer Society, 2005. 5, 6, 66
[61] G. Chen, F. G. Nocetti, J. S. Gonzalez, and I. Stojmenovic, “Connectivity
Based k-Hop Clustering inWireless Networks,” in Proceedings of the 35th Annual
Hawaii International Conference on System Sciences (HICSS, 2002), pp. 2450–
2459, Jan. 2002. 7
[62] M. Gerla and J. T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,”
Wireless Networks, vol. 1, no. 3, pp. 255–265, 1995. 7, 34
[63] M. Gerla, T. Kwon, and G. Pei, “On Demand Routing in Large Ad Hoc
Wireless Networks with Passive Clustering,” in Proceedings of IEEE Wireless
Communications and Networking Conference (WCNC), September 2000. 7, 13,
34, 93
[64] D. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio
Network via a Distributed Algorithm,” IEEE Transactions on Communications,
vol. 29, pp. 1694–1701, Nov 1981. 7
[65] L. Jia, R. Rajaraman, and T. Suel, “An Efficient Distributed Algorithm for
Constructing Small Dominating Sets,” Distributed Computing, vol. 15, no. 4,
pp. 193–205, 2002. 7
129
BIBLIOGRAPHY
[66] R. Sivakumar, P. Sinha, and V. Bharghavan, “CEDAR: A Core-Extraction
Distributed Ad Hoc Routing Algorithm,” IEEE Journal on Selected Areas in
Communications, vol. 17, pp. 1454–1465, Aug 1999. 7, 13, 93, 95
[67] E. M. Belding-Royer, “Multi-Level Hierarchies for Scalable Ad Hoc Routing,”
Wireless Networks, vol. 9, no. 5, pp. 461–478, 2003. 7
[68] B. Liang and Z. J. Haas, “Virtual Backbone Generation and Maintenance in
Ad Hoc Network Mobility Management,” in Proceedings of 19th Annual Joint
Conference of the IEEE Computer and Communications Societies (INFOCOM
2000), vol. 3, pp. 1293–1302 vol.3, Mar 2000. 7
[69] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating
Sets,” Algorithmica, vol. 20, no. 4, pp. 374–387, 1998. 7
[70] K. M. Alzoubi, P. jun Wan, and O. Frieder, “Distributed Heuristics for
Connected Dominating Sets in Wireless Ad Hoc Networks,” Journal of
Communications and Networks, vol. 4, pp. 22–29, 2002. 7
[71] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor
Elimination-Based Broadcasting Algorithms in Wireless Networks,” IEEE
Transactions on Parallel and Distributed Systems, vol. 13, pp. 14–25, Jan 2002.
7
[72] K. M. Alzoubi, P.-J. Wan, and O. Frieder, “Message-Optimal Connected
Dominating Sets in Mobile Ad Hoc Networks,” in Proceedings of the 3rd
ACM international symposium on Mobile ad hoc networking and computing
(MobiHoc’02), (New York, NY, USA), pp. 157–164, ACM, 2002. 7
[73] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient
Routing in Ad Hoc Wireless Networks,” in Proceedings of the 3rd international
workshop on Discrete algorithms and methods for mobile computing and
communications (DIALM ’99), (New York, NY, USA), pp. 7–14, ACM, 1999. 7,
34
[74] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum
Connected Dominating Sets,” in Proceedings of IEEE International Conference
on Communications, (ICC 1997), vol. 1, pp. 376–380 vol.1, Jun 1997. 7, 13, 34,
93
[75] Y. P. Chen and A. L. Liestman, “Approximating Minimum Size Weakly-
Connected Dominating Sets for Clustering Mobile Ad Hoc Networks,” in
Proceedings of the 3rd ACM international symposium on Mobile ad hoc
130
BIBLIOGRAPHY
networking & computing (MobiHoc’02), (New York, NY, USA), pp. 165–172,
ACM, 2002. 7, 34
[76] K. M. Alzoubi, P.-J. Wan, and O. Frieder, “Weakly-Connected Dominating
Sets and Sparse Spanners in Wireless Ad Hoc Networks,” in Proceedings of the
23rd International Conference on Distributed Computing Systems (ICDCS’03),
(Washington, DC, USA), p. 96, IEEE Computer Society, 2003. 7
[77] J. Y. Yu and P. H. J. Chong, “3hBAC (3-hop Between Adjacent Clusterheads):
A Novel Non-Overlapping Clustering Algorithm for Mobile Ad Hoc Networks,”
in IEEE Pacific Rim Conference on Communications, Computers and Signal
Processing (Pacrim’03), vol. 1, pp. 318–321, 2003. 7
[78] A. Ephremides, J. E. Wieselthier, and D. J. Baker, “A Design Concept
for Reliable Mobile Radio Networks with Frequency Hopping Signaling,” in
Proceedings of the IEEE, vol. 75, pp. 56–73, Jan. 1987. 7
[79] C. R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,”
IEEE Journal on Selected Areas in Communications, vol. 15, pp. 1265–1275, Sep
1997. 7
[80] T. J. Kwon, M. Gerla, V. K. Varma, M. Barton, and T. R. Hsing, “Efficient
Flooding with Passive Clustering - An Overhead-Free Selective Forward
Mechanism for Ad Hoc/Sensor Networks,” in Proceedings of the IEEE, vol. 91,
August 2003. 7
[81] W. Liu, C. Chiang, H.Wu, and C. Gerla, “Routing in Clustered Multihop Mobile
Wireless Networks with Fading Channel,” in Proceedings of the IEEE SICON’97,
pp. 197–211, April 1997. 7
[82] P. Basu, N. Khan, and T. D. C. Little, “A mobility based metric for clustering
in mobile ad hoc networks,” in Proceedings of the 21st International Conference
on Distributed Computing Systems (ICDCSW ’01), (Washington, DC, USA),
p. 413, 2001. 7
[83] A. B. McDonald and T. F. Znati, “Design and Performance of a Distributed
Dynamic Clustering Algorithm for Ad-Hoc Networks,” in Proceedings of 34th
Annual Simulation Symposium, 2001, pp. 27–35, 2001. 7
[84] A. D. Amis and R. Prakash, “Load-Balancing Clusters in Wireless Ad Hoc
Networks,” in Proceedings of 3rd IEEE Symposium on Application-Specific
Systems and Software Engineering Technology, pp. 25–32, 2000. 7
131
BIBLIOGRAPHY
[85] J. hee Ryua, S. Song, and D.-H. Cho, “New Clustering Schemes For Energy
Conservation in Two-Tiered Mobile Ad-Hoc Networks,” IEEE Transaction on
Vehicular Technology, vol. 51, Nov. 2002. 7
[86] J. Wu, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected
Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” in
Proceedings of the International Conference on Parallel Processing (ICPP),
(Washington, DC, USA), pp. 346–356, IEEE Computer Society, 2001. 7
[87] R. Ranjan and A. Saad, “Generic Architecture for Power Aware Routing in
Wireless Sensor Networks,” in Proceedings of 29th Annual IEEE International
Conference on Local Computer Networks, pp. 575–576, Nov. 2004. 7
[88] P. Guangyu, M. Geria, and X. Hong, “LANMAR: Landmark Routing for Large
Scale Wireless Ad Hoc Networks with Group Mobility,” in Proceedings of 1st
Annual Workshop on Mobile and Ad Hoc Networking and Computing (MobiHOC
2000), pp. 11–18, 2000. 7, 34, 35, 97
[89] W. Noh, K. Han, and S. An, “Core Nodes Based Stable Routing for Large-Scale
Ad-Hoc Networks,” in Proceedings of 12th IEEE International Conference on
Networks (ICON 2004), vol. 2, pp. 545–549, Nov. 2004. 7
[90] A. Marowka, “Routing speedup in multicore-based ad hoc networks,” in
Proceedings of 6th International Symposium on Parallel and Distributed
Computing (ISPDC ’07), pp. 45–45, July 2007. 7
[91] B.-H. Liu, M.-J. Tsai, and W.-C. Ko, “Dynamical Construction of a Core-
Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks,” in Proceedings
of 19th International Conference on Advanced Information Networking and
Applications (AINA 2005), vol. 1, pp. 90–95 vol.1, March 2005. 7
[92] M. Kochhal, L. Schwiebert, S. Gupta, and C. Jiao, “An Efficient Core
Migration Protocol for QoS in Mobile Ad Hoc Networks,” in Proceedings of 21st
IEEE International Performance, Computing, and Communications Conference,
pp. 387–391, 2002. 7
[93] S. K. S. Gupta and P. K. Srimani, “Adaptive Core Selection and Migration
Method for Multicast Routing in Mobile Ad Hoc Networks,” IEEE Transactions
on Parallel and Distributed Systems, vol. 14, no. 1, pp. 27–38, 2003. 7
[94] J. J. Garcia-Luna-Aceves and E. L. Madruga, “The Core-Assisted Mesh
Protocol,” IEEE Journal on Selected Areas in Communications,, vol. 17,
pp. 1380–1394, Aug 1999. 7
132
BIBLIOGRAPHY
[95] G. Das, M. Fazio, M. Villari, and A. Puliafito, “Distributed Core Assisted
Scalable Data Dissemination in Mobile Ad Hoc Networks,” in Proceedings of
International Conference on Collaborative Computing: Networking, Applications
and Worksharing, 2005, 2005. 7
[96] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR).”
IETF, 2003. 7
[97] J. Biswas, M. Barai, and S. K. Nandy, “Efficient Hybrid Multicast Routing
Protocol for Ad-Hoc Wireless Networks,” in Proceedings of 29th Annual IEEE
International Conference on Local Computer Networks, 2004, pp. 180–187, Nov.
2004. 7
[98] C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced
Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM
Computer Communications Review, vol. 24, no. 4, pp. 234–244, 1994. 8, 37,
63
[99] J. J. Garcia-Luna-Aceves and E. L. Madruga, “The Core-Assisted Mesh
Protocol,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8,
pp. 1380–1394, 1999. 8, 37, 63
[100] T. Gopalsamy, M. Singhal, D. Panda, and P. Sadayappan, “A Reliable Multicast
Algorithm for Mobile Ad hoc Networks,” in Proceedings of 22nd International
Conference on Distributed Computing Systems, pp. 563–570, July 2002. 8, 37,
40, 63
[101] A. Sobeih, H. Baraka, and A. Fahmy, “ReMHoc: A Reliable Multicast Protocol
for Wireless Mobile Multihop Ad Hoc Networks,” in Proceedings of Consumer
Communications and Networking Conference (CCNC), pp. 146–151, 2004. 8,
37, 63
[102] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad hoc
Networks,” in Proceedings of the Wireless Communications and Networking
(WCNC 2003), pp. 1118–1123, March 2003. 8, 37, 63
[103] E. M. Royer and C. E. Perkins, “Multicast Operation of the Ad-Hoc On-demand
Distance Vector Routing Protocol,” in Proceedings of the 5th annual ACM/IEEE
international conference on Mobile computing and networking (MobiCom’99),
(New York, NY, USA), pp. 207–218, ACM, 1999. 8, 63
[104] M. Gerla, S. J. Lee, and W. Su, “On-Demand Multicast Routing Protocol
(ODMRP) for Ad hoc Networks,” IETF Internet Draft, 2000. 8, 63
133
BIBLIOGRAPHY
[105] C. J. Liu, H. C. Lee, J. Yang, J. T. Huang, Y. M. Fang, B. J. Lee, and C. T. King,
“Development of a Long-Lived, Real-time Automatic Weather Station Based on
WSN,” in Proceedings of the 6th ACM conference on Embedded network sensor
systems (SenSys’08), Poster,, (New York, NY, USA), ACM, Nov 2008. 8, 63
[106] C. Y. Cho, P. H. Chou, Y. C. Chung, C. T. King, M. J. Tsai, B. J. Lee, and T. Y.
Chou, “Wireless Sensor Networks for Debris Flow Observation,” in Proceedings of
the 2nd International Conference on Urban Disaster Reduction (ICUDR 2007),
Nov 2007. 8, 63
[107] S. Kim, R. Fonseca, P. Dutta, A. Tavakoli, D. Culler, P. Levis, S. Shenker, and
I. Stoica, “Flush: A Reliable Bulk Transport Protocol for Multihop Wireless
Networks,” in Proceedings of the 5th international conference on Embedded
networked sensor systems (SenSys’07), (New York, NY, USA), pp. 351–365,
ACM, 2007. 8, 63
[108] K. Tang, K. Obraczka, S. J. Lee, and M. Geria, “A Reliable, Congestion-
Controlled Multicast Transport Protocol in Multimedia Multi-hop Networks,”
in Proceedings of the 5th International Symposium on Wireless Personal
Multimedia Communications (WPMC 2002), pp. 252–256, Oct. 2002. 8, 40
[109] V. Rajendran, Y. Yi, K. Obraczka, S. J. Lee, K. Tang, and M. Gerla, “Reliable,
Adaptive, Congestion-Controlled Adhoc Multicast Transport Protocol: Combining
Source-based and Local Recovery.” UCSC Technical Report, 2003. 8,
40
[110] W. Liao and M. Y. Jiang, “Family ACK Tree (FAT): Supporting Reliable
Multicast in Mobile Ad-Hoc Networks,” IEEE Transactions on Vehicular
Technology, vol. 52, pp. 1675–1685, Nov 2003. 8, 40
[111] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek,
and H. Balakrishnan, “Chord: A Scalable Peer-to-peer Lookup Protocol for
Internet Applications,” IEEE/ACM Transactions on Networking, vol. 11, no. 1,
pp. 17–32, 2003. 9, 12, 38, 63, 66
[112] G. Pei, M. Gerla, X. Hong, and C.-C. Chiang, “A Wireless Hierarchical
Routing Protocol with Group Mobility,” in Proceedings of IEEE Wireless
Communications and Networking Conference (WCNC 1999), pp. 1538–1542
vol.3, 1999. 13, 34, 35, 93
[113] M. Jiang, J. Ti, and Y. Tay, “Cluster Based Routing Protocol.” Internet Draft,
draft-ietf-manet-cbrpspec-01.txt, August 1999. 13, 93, 95
134
BIBLIOGRAPHY
[114] S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu,
“Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table,”
Mobile Networks and Applications, vol. 8, no. 4, pp. 427–442, 2003. 13, 34, 35,
93
[115] Y. Xue, B. Li, and K. Nahrstedt, “A Scalable Location Management Scheme in
Mobile Ad-Hoc Networks,” in Proceedings of the 26th Annual IEEE Conference
on Local Computer Networks (LCN ’01), (Washington, DC, USA), p. 102, IEEE
Computer Society, 2001. 13, 14, 34, 35, 93, 94, 107
[116] J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris, “A
Scalable Location Service for Geographic Ad Hoc Routing,” in Proceedings of
the 6th annual international conference on Mobile computing and networking
(MobiCom’00), (New York, NY, USA), pp. 120–130, ACM, 2000. 13, 14, 34, 35,
93, 94, 107
[117] Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang, “GLIDER: Gradient
Landmark-Based Distributed Routing for Sensor Networks,” in Proceedings of
24th Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM 2005), vol. 1, pp. 339–350 vol. 1, March 2005. 14, 34,
35, 94, 97, 107
[118] M. Joa-Ng and I.-T. Lu, “A Peer-to-Peer Zone-based Two-level Link State
Routing for Mobile Ad Hoc Networks,” IEEE Journal on Selected Areas in
Communications, vol. 17, pp. 1415–1425, Aug 1999. 14, 34, 35, 94, 97, 107
[119] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for Parallel
Simulation of Large-Scale Wireless Networks,” ACM SIGSIM Simulation Digest,
vol. 28, no. 1, pp. 154–161, 1998. 17, 54, 80
[120] J. L. Wang and J. A. Silvester, “Delay Minimization of the Adaptive Go-
Back-N ARQ Protocols for Point-to-Multipoint Communication,” in INFOCOM
’89. Proceedings of the 8th Annual Joint Conference of the IEEE Computer
and Communications Societies. Technology: Emerging or Converging, IEEE,
pp. 584–593 vol.2, Apr 1989. 22
[121] D. Towsley, “An Analysis of a Point-to-Multipoint Channel Using a Go-Back-
N Error Control Protocol,” IEEE Transactions on Communications, vol. 33,
pp. 282–285, Mar 1985. 22
[122] S. Paul, K. Sabnani, and D. Kristol, “Multicast Transport Protocols for
High Speed Networks,” in Proceedings of International Conference on Network
Protocols, pp. 4–14, Oct 1994. 22
135
BIBLIOGRAPHY
[123] T. Gopalsamy, M. Singhal, D. Panda, and P. Sadayappan, “A Reliable Multicast
Algorithm for Mobile Ad Hoc Networks,” in Proceedings of 22nd International
Conference on Distributed Computing Systems, pp. 563–570, 2002. 22, 23
[124] S. R. Chandran and S. Lin, “Selective-Repeat-ARQ Schemes for Broadcast
Links,” IEEE Transactions on Communications, vol. 40, pp. 12–19, Jan 1992.
22
[125] P. Bhagwat, P. P. Mishra, and S. K. Tripathi, “Effect of Topology on Performance
of Reliable Multicast Communication,” in Proceedings of IEEE INFOCOM’94,
pp. 602–609, 1994. 22
[126] S. Floyd, V. Jacobson, S. McCanne, C.-G. Liu, and L. Zhang, “A Reliable
Multicast Framework for Light-Weight Sessions and Application Level Framing,”
IEEE/ACM Transactions on Networking, vol. 25, no. 4, pp. 342–356, 1995. 22,
23, 24
[127] C.-G. Liu, D. Estrin, S. Shenker, and L. Zhang, “Local Error Recovery in SRM:
Comparison of Two Approaches,” IEEE/ACM Transactions on Networking,
vol. 6, pp. 686–699, Dec 1998. 22, 23, 25
[128] A. Sobeih, H. Baraka, and A. Fahmy, “ReMHoc: A Reliable Multicast Protocol
for Wireless Mobile Multihop Ad Hoc Networks,” in Proceedings of 1st IEEE
Consumer Communications and Networking Conference (CCNC 2004), pp. 146–
151, Jan. 2004. 22, 23, 26
[129] R. Braudes and S. Zabele, “Requirements for Multicast Protocols,” in RFC 1458,
1993. 22, 23
[130] S. Ramakrishnan and B. N. Jain, “A Negative Acknowledgement with Periodic
Polling Protocol for Multicast over LANs,” in Proceedings of IEEE INFOCOM,
pp. 502–511, April 1997. 22, 23
[131] K. Tang, K. Obraczka, S. Lee, and M. Gerla, “A Reliable, Congestion-
Controlled Multicast Transport Protocol in Multimedia Multi-Hop Networks,”
in Proceedings of IEEE WPMC, pp. 252–256, 2002. 23, 31
[132] V. Rajendran, Y. Yi, K. Obraczka, S. J. Lee, K. Tang, and M. Gerla, “Reliable,
Adaptive, Congestion-Controlled Adhoc Multicast Transport Protocol: Combining
Source-based and Local Recovery,” tech. rep., UCSC Technical Report,
2003. 23
136
BIBLIOGRAPHY
[133] S. Raman, S. McCanne, and S. Shenker, “Asymptotic Behavior of Global
Recovery in SRM,” in Proceedings of the 1998 ACM SIGMETRICS joint
international conference on Measurement and modeling of computer systems
(SIGMETRICS ’98/PERFORMANCE ’98), (New York, NY, USA), pp. 90–99,
ACM, 1998. 25
[134] J. Nonnenmacher, M. Lacher, M. Jung, E. Biersack, and G. Carle, “How Bad
is Reliable Multicast Without Local Recovery?,” in Proceedings of Seventeenth
Annual Joint Conference of the IEEE Computer and Communications Societies
(INFOCOM’98), vol. 3, pp. 972–979 vol.3, Mar-2 Apr 1998. 25
[135] S. Paul, K. K. Sabnani, J. C. H. Lin, and S. Bhattacharyya, “Reliable
Multicast Transport Protocol (RMTP),” IEEE Journal on Selected Areas in
Communications, vol. 15, pp. 407–421, Apr 1997. 26, 27
[136] W. Liao and M. Y. Jiang, “Family ACK Tree (FAT): Supporting Reliable
Multicast in Mobile Ad Hoc Networks,” IEEE Transactions on Vehicular
Technology, vol. 52, pp. 1675–1685, Nov 2003. 26, 27
[137] A. Acharya and B. R. Badrinath, “A Framework for Delivering Multicast
Messages in Networks With Mobile Hosts,” ACM/Baltzer Journal of Wireless
Networks, Special Issue on Routing in Mobile Communication Networks, 1996.
26, 27
[138] A. Acharya and B. R. Badrinath, “Delivering Multicast Messages in Networks
with Mobile Hosts,” in Proceedings the 13th International Conference on
Distributed Computing Systems, pp. 292–299, May 1993. 26, 27
[139] K. Brown and S. Singh, “RelM: Reliable Multicast for Mobile Networks,” Journal
of Computer Communications, vol. 21, pp. 1379–1400, 1998. 26, 27
[140] H. Shin, “A Hierarchical Ack-Based Protocol for Reliable Multicast in Mobile
Networks,” in Proceedings of the 8th IEEE International Conference on Networks
(ICON’00), (Washington, DC, USA), p. 359, IEEE Computer Society, 2000. 26,
28
[141] S. K. S. Gupta and P. K. Srimani, “An Adaptive Protocol for Reliable Multicast
in Mobile Multi-hop Radio Networks,” in Proceedings of IEEE Workshop on
Mobile Computing Systems and Applications, pp. 111–122, 1999. 27, 28
[142] D. E. Comer, Internetworking with TCP/IP: Principles, Protocols, and
Architecture (Hardcover). Prentice Hall, 5th ed., 2006. 31
137
BIBLIOGRAPHY
[143] Z. Fu, B. Greenstein, X. Meng, and S. Lu, “Design and Implementation of a
TCP-Friendly Transport Protocol for Ad Hoc Wireless Networks,” in Proceedings
of the 10th IEEE International Conference on Network Protocols (ICNP’02),
(Washington, DC, USA), pp. 216–225, IEEE Computer Society, 2002. 31
[144] L. Yang, W. K. Seah, and Q. Yin, “Improving Fairness among TCP Flows
crossing Wireless Ad Hoc and Wired Networks,” in Proceedings of the 4th
ACM international symposium on Mobile ad hoc networking & computing
(MobiHoc’03), (New York, NY, USA), pp. 57–63, ACM, 2003. 31
[145] F. Wang and Y. Zhang, “Improving tcp performance over mobile ad-hoc
networks with out-of-order detection and response,” in Proceedings of the 3rd
ACM international symposium on Mobile ad hoc networking & computing
(MobiHoc’02), (New York, NY, USA), pp. 217–225, ACM, 2002. 31
[146] S. Papanastasiou and M. Ould-Khaoua, “Tcp congestion window evolution and
spatial reuse in manets: Research articles,” Wirel. Commun. Mob. Comput.,
vol. 4, no. 6, pp. 669–682, 2004. 31
[147] D. Kim, C. K. Toh, and Y. Choi, “TCP-BuS: Improving TCP Performance
in Wireless Ad Hoc Networks,” in IEEE International Conference on
Communications (ICC’00), vol. 3, pp. 1707–1713, 2000. 31
[148] B. Scheuermann, M. Transier, C. Lochert, M. Mauve, and W. Effelsberg,
“Backpressure Multicast Congestion Control in Mobile Ad-Hoc Networks,” in
Proceedings of the 2007 ACM CoNEXT conference (CoNEXT’07), (New York,
NY, USA), pp. 1–11, ACM, 2007. 31
[149] K. lae Noh, E. Serpedin, and K. Qaraqe, “A New Approach for
Time Synchronization in Wireless Sensor Networks: Pairwise Broadcast
Synchronization,” IEEE Transactions on Wireless Communications, vol. 7,
pp. 3318–3322, September 2008. 32
[150] T. Koskiahde, J. Kujala, and T. Norolampi, “A Sensor Network Architecture
for Military and Crisis Management,” in Proceedings of IEEE International
Symposium on Precision Clock Synchronization for Measurement, Control and
Communication (ISPCS 2008), pp. 110–114, Sept. 2008. 32
[151] S. Palchaudhuri, A. Saha, and D. Johnsin, “Adaptive Clock Synchronization in
Sensor Networks,” in Third International Symposium on Information Processing
in Sensor Networks (IPSN 2004), pp. 340–348, April 2004. 32
138
BIBLIOGRAPHY
[152] S. Trikaliotis and G. Lukas, “Evaluating a Clock Synchronization for Dependable
Sensor Networks,” in Proceedings of 20th International Parallel and Distributed
Processing Symposium (IPDPS 2006), April 2006. 32
[153] K. Sun, P. Ning, and C. Wang, “Fault-Tolerant Cluster-Wise Clock
Synchronization for Wireless Sensor Networks,” IEEE Transactions on
Dependable and Secure Computing, vol. 2, pp. 177–189, July-Sept. 2005. 32
[154] K. L. Noh, Q. Chaudhari, E. Serpedin, and B. Suter, “Power-Efficient
Clock Synchronization using Two-Way Timing Message Exchanges in Wireless
Sensor Networks,” in Proceedings of IEEE Military Communications Conference
(MILCOM 2006), pp. 1–7, Oct. 2006. 32
[155] Q. Li and D. Rus, “Global Clock Synchronization in Sensor Networks,” IEEE
Transactions on Computers, vol. 55, no. 2, pp. 214–226, 2006. 32
[156] M. Maekawa, “A N Algorithm for Mutual Exclusion in Decentralized Systems,”
ACM Transactions on Computer Systems (TOCS), vol. 3, no. 2, pp. 145–159,
1985. 33
[157] J.-R. Jiang, “A Distributed h-out of -k Mutual Exclusion Algorithm for Ad
Hoc Mobile Networks,” in Proceedings of the 16th International Parallel and
Distributed Processing Symposium (IPDPS’02), (Washington, DC, USA), p. 5,
IEEE Computer Society, 2002. 33
[158] J.-R. Jiang, “A Distributed h-out of-k Mutual Exclusion Algorithm with
Maximum Degree of Concurrency for Mobile Ad Hoc Networks and Distributed
Systems,” in Proceedings of the Fourth International Conference on Parallel and
Distributed Computing, Applications and Technologies (PDCAT’2003), pp. 329–
334, Aug. 2003. 33
[159] R. Baldoni, A. Virgillito, and R. Pehass, “A Distributed Mutual Exclusion
Algorithm for Mobile Ad-Hoc Networks,” in Proceedigs of International
Symposium on Computers and Communications (ISCC 2002), pp. 539–544, July
2002. 33
[160] J. E. Walter, “A k-Mutual Exclusion Algorithm for Ad-Hoc Mobile Networks,”
in Proceedings of 1st International Workshop of Principles of Mobile Computing
(POMC’01), 2001. 33
[161] J. E. Walter, J. L. Welch, and N. H. Vaidya, “A Mutual Exclusion Algorithm for
Ad Hoc Mobile Networks,” Wireless Networks, vol. 7, no. 6, pp. 585–600, 2001.
33
139
BIBLIOGRAPHY
[162] M. Benchaïba, A. Bouabdallah, N. Badache, and M. Ahmed-Nacer, “Distributed
Mutual Exclusion Algorithms in Mobile Ad Hoc Networks: An Overview,” ACM
SIGOPS Operating Systems Review, vol. 38, no. 1, pp. 74–89, 2004. 33
[163] J. Wu, Dominating-set-based Routing in Ad Hoc Wireless Networks. New York,
NY, USA: John Wiley & Sons, Inc., 2002. 33
[164] T.-C. Hou and T.-J. Tsai, “A Access-Based Clustering Protocol for
Multihop Wireless Ad Hoc Networks,” IEEE Journal on Selected Areas in
Communications,, vol. 19, pp. 1201–1210, Jul 2001. 34
[165] P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed Construction of
Connected Dominating Set in Wireless Ad Hoc Networks,” Mobile Networks
and Applications, vol. 9, no. 2, pp. 141–149, 2004. 34
[166] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast
Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-
Size Skeletons,” in Proceedings of the 14th annual ACM-SIAM symposium on
Discrete algorithms (SODA’03), (Philadelphia, PA, USA), pp. 717–724, Society
for Industrial and Applied Mathematics, 2003. 34
[167] N. Nikaein, H. Labiod, and C. Bonnet, “DDR: Distributed Dynamic Routing
Algorithm for Mobile Ad Hoc Networks,” in Proceedings of the 1st ACM
international symposium on Mobile ad hoc networking & computing (MobiHoc
’00), (Piscataway, NJ, USA), pp. 19–27, IEEE Press, 2000. 34, 97
[168] G. Zaruba, V. Chaluvadi, and A. Suleman, “LABAR: Location Area Based
Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks,” in Proceedings
of the First IEEE International Conference on Pervasive Computing and
Communications (PerCom 2003), pp. 509–513, March 2003. 34, 35
[169] L. Raju, S. Ganu, B. Anepu, I. Seskar, and D. Raychaudhuri, “Beacon Assisted
Discovery Protocol (BEAD) for Self-Organizing Hierarchical Ad-Hoc Networks,”
in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM
’04), vol. 3, pp. 1676–1680 Vol.3, Nov.-3 Dec. 2004. 34, 35
[170] S. Y. Hsieh, G. H. Chen, and C. W. Ho, “Fault-Free Hamiltonian Cycles in
Faulty Arrangement Graphs,” IEEE Transactions on Parallel and Distributed
Systems, vol. 10, pp. 223–237, March 1999. 38, 63, 65
[171] R. A. Rowley and B. Bose, “Fault-Tolerant Ring Embedding in de Bruijn
Networks,” IEEE Transactions on Computers, vol. 42, no. 12, pp. 1480–1486,
1993. 38, 63, 65
140
BIBLIOGRAPHY
[172] A. Sobeih, W. Yurcik, and J. C. Hou, “VRing: A Case for Building
Application-Layer Multicast Rings (Rather Than Trees),” in Proceedings of 12th
International Symposium on Modeling, Analysis, and Simulation of Computer
and Telecommunications Systems, (MASCOTS 2004), pp. 437–446, 2004. 38,
63, 65
[173] E. Levy, G. Louchard, and J. Petit, “A Distributed Algorithm to Find
Hamiltonian Cycles In G(n,p) Random Graphs,” in Proceedings of Workshop
on Combinatorial and Algorithmic Aspects of Networking, 2004. 38, 63
[174] R. Baldoni, A. Virgillito, and R. Petrassi, “A Distributed Mutual Exclusion
Algorithm for Mobile Ad-Hoc Networks,” in Proceedings of the 7th International
Symposium on Computers and Communications (ISCC’02), pp. 539–545, 2002.
40, 78
[175] J.-M. Helary, A. Mostefaoui, and M. Raynal, “A General Scheme for Token and
Tree based Distributed Mutual Exclusion Algorithm,” IEEE Transactions on
Parallel and Distributed Systems, vol. 5, pp. 1185–1196, Nov 1994. 40, 41
[176] K. Raymond, “A Tree-Based Algorithm for Distributed Mutual Exclusion,” ACM
Transaction on Computer Systems, vol. 7, no. 1, pp. 61–77, 1989. 40, 41, 89
[177] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector
(AODV) Routing,” IETF Internet Draft, 2003. 54, 80
[178] B. Bollobás, T. I. Fenner, and A. M. Frieze, “An Algorithm for Finding Hamilton
Cycles in Random Graphs,” in Proceedings of the seventeenth annual ACM
symposium on Theory of computing (STOC’85), (New York, NY, USA), pp. 430–
439, ACM, 1985. 65
[179] C. E. Perkins, “Mobile Ad hoc Networking Terminology.” Internet Draft, draftietf-
manet-term-00.txt, October 1997. 93, 108
[180] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless
Networks,” Mobile Computing, vol. 353, pp. 153–181, 1996. 93
[181] C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced
Distance-Vector routing (DSDV) for mobile computers,” in Proceedings of ACM
SIGCOMM, vol. 24, (New York, NY, USA), pp. 234–244, ACM, 1994. 93
[182] N. Nikaein, C. Bonnet, and N. Nikaein, “HARP - Hybrid Ad Hoc Routing
Protocol,” in Proceedings of International Symposium on Telecommunications,
IST, (Tehran, Iran), 2001. 97, 107
141
BIBLIOGRAPHY
[183] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for Parallel
Simulation of Large-Scale Wireless Networks,” in Proceedings of 12th Workshop
on Parallel and Distributed Simulation (PADS ’98), vol. 28, (New York, NY,
USA), pp. 154–161, ACM, 1998. 108
[184] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,”
in Proceedings of 22nd Annual Joint Conference of the IEEE Computer and
Communications Societies (INFOCOM 2003), vol. 2, pp. 1312–1321 vol.2,
March-3 April 2003. 108
[185] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc
Network Research,” Wireless Communications & Mobile Computing (WCMC):
Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications,
vol. 2, no. 5, pp. 483–502, 2002. 108
[186] ETSI, “Universal Mobile Telecommunications System (UMTS); Selection
Procedures for the Choice of Radio Transmission Technologies of the UMTS,”
tech. rep., UMTS 30.03, version 3.2.0, 1998. 115
[187] “BonnMotion - A Mobility Scenario Generation and Analysis Tool.”
http://web.informatik.unibonn.de/IV/Mitarbeiter/dewaal/BonnMotion/. 115