Self-organizing Mobile Networks Research Articles

An Adaptive Energy Aware Algorithm for Reliable Transmission Sensor Networks

Route maintenance and repair process plays an important role in mobile selforganizing network. On the basis of considering route stability and energy aware routing protocol, a new scheme is proposed in this paper. Firstly, signal strength, rest energy and port queue length are periodically and alternately detected; secondly, cross-layer method is adopted for route maintenance, and the alternate route is actively established for data transmission according to the routing repair mechanism “Make-before-Break”; finally, relevant experiment is carried out in NS2 to simulate and compare the proposed protocol and other similar routing protocols such as RSEA and LAER. The experiment result shows that the new scheme has good performance in the aspects of data packet delivery ratio, overhead control and end-to-end delay.

Design Methodology for Self-organized Mobile Networks Based

The methodology proposed in this article enables a systematic design of routing algorithms based on schemes of biclustering, which allows you to respond with timely techniques, clustering heuristics proposed by a researcher, and a focused approach to routing in the choice of clusterhead nodes. This process uses heuristics aimed at improving the different costs in communication surface groups called biclusters. This methodology globally enables a variety of techniques and heuristics of clustering that have been addressed in routing algorithms, but we have not explored all possible alternatives and their different assessments. Therefore, the methodology oriented design research of routing algorithms based on biclustering schemes will allow new concepts of evolutionary routing along with the ability to adapt the topological changes that occur in self-organized data networks.

MODEL IMPROVEMENT OF MESSAGE SECURE ROUTING WITH OPTIMAL BALANCING ITS FRAGMENTS NUMBER TRANSMITTED OVER NON OVERLAPPING PATHS

The given work is devoted to improvement andinvestigation of secure routing model with optimalbalancing of message fragments number in mobile selforganizingnetworks. Within the work it was explored theconcept of threshold secret sharing scheme in relation tosecure routing using non overlapping paths for themessage frag-ments transmission. Based on analysis ofdisadvantages of existing mechanism SPREAD it wasproposed the im-provement of fragments allocationmodel which had been reduced to the optimal balancingof message fragments number transmitted over the nonoverlapping paths. It was proposed several optimalitycriterions related to the so-lution of balancing problem.In a comparative analysis it is justified to use on practiceoptimality criterion, providing on the one handminimizing dynamically managed upper bound number offragments transmitted over separate non overlappingpaths in the network, and from the other hand – to adaptto security parameters (probability of compromise) ofindividual network elements: nodes, links and paths.Numerical examples of models with different optimalitycriterion of the solutions obtained, and their comparativeanalysis represented. The comparison results confirmed the effectiveness of the proposed model, when by theworst path in terms of the probability of com-promisetransmitted the minimum number of fragments, and bythe best path – their maximum number.

Scalable peer-to-peer resource discovering scheme for wireless self-organized networks

Peer-to-peer technologies have attracted increasing research attention with fruitful protocols and applications proposed for wired networks. As to mobile environments, there are currently no mature deployments. A novel resource managing and discovering protocol, Cheer, is proposed to realize scalable and effective peer-to-peer lookup in wireless self-organized networks. Cheer resolves the topologies mismatch problem between peer-to-peer overlay networks and actual nodes distribution, allowing for frequent nodes membership changes. With specially designed resource storage table, Cheer also supports multikey and fuzzy lookup. Its hybrid architecture and improved routing scheme based on small-world theory may realize effective lookup routing. Theoretical analysis and simulation results both prove that Cheer makes using peer-to-peer applications in large-scale self-organized mobile networks feasible and promising.

Twins: A Dual Addressing Space Representation for Self-Organizing Networks

As the size of mobile self-organizing networks increases, the efficiency of location services must increase as well so that addressing/routing scalability does not become an issue. In this paper, we propose a novel architecture, called Twins, tailored for self-organizing networks. Twins architecture involves addressing and locating nodes in large networks, forwarding packets between them, and managing in the presence of mobility/topology changes. Twins defines a logical multidimensional space for addressing and forwarding, while location service and management operations make use of a one-dimensional space. To improve scalability and performance, forwarding is hop-by-hop with greedy next-hop choice and the location service uses a rendezvous paradigm to distribute information among nodes. In this paper, we describe the Twins architecture and present a performance evaluation to assess scalability, fairness in the overhead distribution among nodes, and routing robustness.

Reconsidering microscopic mobility modeling for self-organizing networks

Mobility modeling is a critical step in the design of mobile self-organizing networks. With the emergence of small-scale and short-range wireless communication devices, the communication sphere shrinks (radio range or sensing range), which leads to an increase in the need for fine-grained representations of mobility. In fact, mobility models must scale accordingly to the application and reflect real scenarios in which wireless devices are deployed. Currently, self-organizing networks are evaluated using mobility models that do not represent the precise motion of mobile individuals at small scales. In this article we present a new class of mobility models, namely, behavioral mobility (BM) models, which decomposes mobility into simple atomic individual behaviors. Combined, these behaviors yield realistic displacement patterns by reproducing the mobility observed at small scales in every day life, in both space and time