This contribution provides an approach for an ad-hoc messaging network (AMNET), which uses simple store-and-forward message passing to spread data asynchronously. This approach focuses primarily on application-specific needs that can be covered by simple message passing mechanisms. In this paper, we will describe a network based on the AMNET approach. Results are derived by scenario analysis to provide insights into speeding up the network setup process and enable the use of AMNETs - even with a limited number of participants - by introducing a hybrid infrastructure and by adding mobile nodes.
TopRouting In Mobile Networks
In this section, we describe the AMNET approach, based on the IEEE 802.15 Bluetooth standards for wireless local networks (e.g. personal area networks). We will concentrate on the issue of addressing and routing messages in the first step. Second, we will discuss the potentials and possible applications for AMNETs.
In recent years, a growing number of research has been conducted on routing in MANETs (Artail et al. 2008, Chin et al., 2002; Royer et al., 1999; Xu et al., 2003), particularly with regard to the limitations of routing protocols (Ni et al., 1999). Some reactive and proactive routing algorithms are provided with respect to different situations. Common protocols show specific vulnerabilities according to scalability, mobility, and network utilization. In growing networks, both methods run out of control because scalability is not suitable and depends on the network’s structure. According to Broch et al. (Broch et al., 1998), the main factors that delay the effectiveness of the algorithms in scaling networks are unpredictable mobility, network load, and complex topology. Networks with fast moving nodes often change their topology. These “vivid” networks rely on mechanisms to find routes that are too complex to grant enduring topologies (Chlamtac et al., 2003).
These highly dynamic MANETs, which contain a large number of network nodes, are based on ad-hoc routing protocols (Ni et al., 1999; Woo et al., 2001). In practice, a trade-off between stability and the maintenance of bandwidth overhead limits the effectiveness of those settings in growing scenarios. Especially reactive algorithms tend to be unusable within huge networks, and reactive routing algorithms do not tend to scale well in large settings (Xiaoyan et al., 2002; Yu-Chee et al., 2002).