Search

Wireless ad hoc network is popular in the research direction of network, and it has quite good application foreground in both civil and military aspect. However, traditional network and wireless ad hoc network distinguishes from one another on self-organization, which leads to a new problem, that traditional network security protection technology cannot be applied directly. Now whether wireless ad hoc network can be applied and popularized, and whether safe wireless ad hoc network can be constructed to ensure its security becomes vital. In this paper, the author assumes that a model based on ADHOC-ECDSA algorithm can cover all problems, including identity authentication combined with allocation address. Then we can modify basic algorithm by applying elliptic curve, and complete safety single hop, or even complete safety multi hop based on the algorithm of routing security protocol. In this paper, by analyzing the research progress of the network and its requirements of security protection, and by applying testing machine to prevent invasion, we present specific model design plan and analysis of security protection. In the mean time, popularization of wireless ad hoc network becomes possible. [ABSTRACT FROM AUTHOR]

This paper presented a new MANET accessing Internet model. In this model, the benefits of three nodes-the source node, gateway node and decision node, were considered synthetically, and gateways were arranged and selected according to the real-time state of accessing network. Otherwise, it simulated the pheromone's update process in ant colony algorithm and computed transmission probability according to the pheromone density on the link, link bandwidth and delay, which are found in searching route.When the gateway pheromone was calculated, it would be added to RREQ. This model was simulated by NS 2. The test result indicated that though it increased average delay, it reduced routing overhead effectively and increased packet delivery radio. The validity of algorithm is validated. [ABSTRACT FROM AUTHOR]

Due to advances of network enabled wireless devices, there is a growing trend of the use of networked and distributed mobile devices. As a result, deployment of day to day applications in MANET for information services is also rapidly evolving in ad hoc mobile environments, with the growing number of mobile users. The application running on different devices can be accessed as a service by different users on an on demand basis. These scenario demands deployment of Service Oriented Architecture (SOA) in MANET for efficient access and usage of applications. Since nodes in MANET does not have any prior knowledge about other nodes, in many cases, the publish/subscribe communication paradigm that has the decoupling and asynchrony properties can be useful to share services between nodes. Unfortunately, none of the currently available content-based publish-subscribe system fit the requirements of such dynamic environments. In this paper several distributed publish/subscribe mechanisms for improving the reliability of the service discovery process is analyzed. Nodes in MANET are constrained by limited processing power, battery power, memory etc, so there lays a need to find appropriate nodes for service brokering. To select a broker for publishing services, parameters like available battery power, CPU power, memory capacity, nodes mobility etc. needs to be considered. In this paper a broker selection model based on the above mentioned parameters is proposed. Unlike other mobility prediction algorithms in terms of speed which require devices to be equipped with GPS to predict the mobility, mobility in the proposed algorithm is detected using frequent change of neighborhood. [ABSTRACT FROM AUTHOR]

Ad-hoc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding an optimal path. In this paper, however, we consider the routing problem from the viewpoint of sustaining QoS (quality of service) requirement. Some algorithms such as MP-DSR already have considered this problem in terms of the end-to-end reliability requirement. While the Multi-Path Dynamic Source Routing (MP-DSR) algorithm is capable of resolving the issue to a certain extent, it only considers disjoint paths between a pair of source and destination nodes. In reality due to mobility of nodes there may not exist such disjoint paths. In this paper the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement. [ABSTRACT FROM AUTHOR]