A weight-value algorithm for finding connected dominating sets in a MANET

In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments.     

Ad hoc node connectivity improvement analysis – Why not through mesh clients?

A mobile ad-hoc network (MANET) is a complex distributed system with unpredictable node movements, which results in frequent node disconnectivity. In a MANET, each node works independently, using the resources based on individual need. The main problem with this arises during the movement of the nodes and random utilization of network resources. This work attempts to solve the mobility maintenance issues using three mesh structures; (i) mesh tree (M_T), (ii) mesh backbone (M_B) and (iii) mesh cluster (M_C). The mobility maintenance architectures are formed based on a localized connectivity analysis and the node degree as a key parameter for network construction. The performance of the proposed work is analysed through mathematical models and simulation results.     

基于多模电台的SDMANET网络组网方法

软件定义网络（SDN）在有线网络和数据中心网络等多种网络场景中正在快速发展,然而在移动自组织网络（MANET）中SDN的使用仍然处于起步阶段。因MANET网络拓扑变化频繁、资源受限以及采用分布式组网方式等特点使得在其中应用SDN变得具有挑战性。为此,本文提出一种基于多模电台的软件定义移动自组织网络（SDMANET）组网方法。该方法使用支配集算法计算骨干节点,仅由骨干节点使用带外信道和SDN控制器通信,并在MAC层基于骨干节点进行TDMA时隙动态分配。实验结果表明,与OLSR协议和直接带外控制的SDN方法相比,本方法具有更低的网络控制开销和信道访问时延,在大规模MANET网络中性能较好。     

Hub location in backbone/tributary network design: a review

A common architecture for a communications network consists of tributary networks, which connect nodes to hubs, and a backbone network, which interconnects the hubs. Often, because of the size of the problem or the nature of the application, the design of the backbone network and the tributary networks are considered independently. However, in many cases, it is desirable or necessary to treat backbone and tributary design as an integrated problem, in which a key decision is the choice of hub locations. We provide a review of earlier algorithmic work on this integrated problem, drawing from the literature on facility location, network design, telecommunications, computer systems and transportation. Certain key issues in modeling hub location problems in the particular context of communications networks are discussed, and possible avenues for future work are proposed.     

Visiting Byzantine Agreement underlying Ad Hoc environment

The Mobile Ad Hoc Network (MANET) has become more popular because the MANET is a self-organizing, self-configuring, and an instantly deployable multi-hop wireless network that responds to application needs without any fixed infrastructure. Moreover, the MANET is fault-tolerant and reliable. A mechanism is needed in the MANET that allows a set of nodes to agree on a common value. The distributed Byzantine Agreement (BA) problem is one of the most important issues in designing a fault-tolerant system. In many cases, reaching a common agreement among fault-free nodes in coping with the influence from faulty components is crucial in a fault-tolerant system. When a common agreement is achieved, all fault-free nodes in the system can produce stable results without any influence from the faulty components. In this study, the BA problem is visited in a MANET, in which the components are subject to a malicious fault. The proposed protocol can tolerate the maximum number of allowable faulty nodes using a minimum number of message exchange rounds. Each fault-free node can reach a common agreement value for the BA problem in a MANET. The text was submitted by the authors in English.     

A flocking-based approach to maintain connectivity in mobile wireless ad hoc networks

Mobile ad hoc networks (MANET) have a set of unique challenges, particularly due to mobility of nodes, that need to be addressed to realize their full potentials. Because the mobile nodes of a MANET are free to move rapidly and arbitrarily, the network topology may change unexpectedly. This paper presents a decentralized approach to maintain the connectivity of a MANET using autonomous, intelligent agents. Autonomous agents are special mobile nodes in a MANET, but unlike other nodes, their function is to proactively prevent network bottlenecks and service problems by intelligently augmenting the network topology. To achieve this function without depending on a central network management system, autonomous agents are expected to dynamically relocate themselves as the topology of the network changes during the mission time. A flocking-based heuristic algorithm is proposed to determine agent locations. A computational study is performed to investigate the effect of basic flocking behaviors on the connectivity of a MANET.     

A branch-and-cut algorithm for two-level survivable network design problems

This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of the hubs through a backbone network (first network level), and the assignment of terminals to hubs and their connection through access networks (second network level). We consider two survivable structures in both network levels. One structure is a two-edge connected network, and the other structure is a ring. There is a limit on the number of nodes in each access network, and there are fixed costs associated with the hubs and the access and backbone links. The aim of the problem is to minimize the total cost. We give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results. Some of the new inequalities can be used also to solve other problems in the literature, like the plant cycle location problem and the hub location routing problem.     

A dynamic overlay approach for mobility maintenance in personal communication networks

The location predictions of the nodes are the key issues in mobile environment. The applications like video sharing, voice over IP and other online applications offer better results with stable nodes. In mobile scenario, connectivity and quality of service are critical issues. To overcome these issues dynamic overlay approaches are proposed in this work namely, 1.Mobile Peers-Unstructured, 2.Structured Peer, 3.MANET Structure and 4.Mesh Backbone. These structures are obtained from the network, during the requirement of connectivity or quality of service. The performance of the proposed methods are analyzed in stable and mobile conditions by analyzing power consumption, hop stretch, packet delivery ratio, network life time and other QoS parameters.     

物联网中移动Sensor节点漫游的组合安全认证协议

物联网包含感知子网和传输骨干网,其感知子网中节点能力受限,往往利用移动的传感器节点跨区域访问来获取信息;而其传输骨干网络需要依托现有Internet的基础设施,并利用其提供的强大服务.在这种情况下,移动节点的漫游带来了新的安全问题,一方面移动节点在感知子网间跨区域漫游,虽和MANET中一样需要保证移动节点漫游时高效安全地加入新的拜访域,但因传感节点资源极端受限而对轻量级有更高数量级的要求;另一方面资源受限的感知子网间移动节点漫游仅能提供轻量级安全,但是在接入骨干传输网时,不可因此降低骨干网络已有的安全性,即轻量级的安全协议和传统骨干网协议综合运用时,需具有组合安全性.本文针对这种基于骨干传输网的移动节点漫游问题,提出了一个新的随机漫游认证协议(RMRAP),兼顾安全性和实际应用的可行性,实现了漫游的轻量级身份认证,保护了漫游节点的隐私,同时实现了具有前向安全性,会话密钥对;并针对衔接骨干网和感知子网的基站进行了组合安全性的认证测试,验证了RMRAP的安全性;最后,从理论分析和实验仿真两个方面,分析了RMRAP协议的性能,并和相近工作进行了对比,对比表明,具有组合安全性的RMRAP在计算、通信开销方面,依然具有和同类协议可比较的相近性能.     

A swarm-based efficient distributed intrusion detection system for mobile ad hoc networks (MANET)

In mobile ad hoc network (MANET), the issues such as limited bandwidth availability, dynamic connectivity and so on cause the process of intrusion detection to be more complex. The nodes that monitor the malicious nodes should have necessary residual bandwidth and energy and should be trustable. In order to overcome these drawbacks, in this paper, we propose a swarm-based efficient distributed intrusion detection system for MANET. In this technique, swarm agents are utilised to select the nodes with highest trust value, residual bandwidth and residual energy as active nodes. Each active node monitors its neighbour nodes within its transmission range and collects the trust value from all monitored nodes. The active nodes adaptively change as per the trust thresholds. Upon collaborative exchange of the trust values of the monitored nodes among the active nodes, if the active node finds any node below a minimum trust threshold, then the node is marked as malicious. When the source receives alert message about the malicious node, a defence technique is deployed to filter the corresponding malicious node from the network. By simulation results, we show that the proposed approach is efficient intrusion detection mechanism for MANET.     

Quorum and connected dominating sets based location service in wireless ad hoc, sensor and actuator networks

Location service provides position of mobile destination to source node to enable geo-routing. In existing quorum-based location service protocols, destination node registers its location along a ‘column’ while source node makes a query along a ‘row’. Grid and quorum-based location service is based on division of network into square grids, and selecting ‘leader’ location server node in each grid. Location updates, leader reelection and information transfer are performed whenever destination and leader nodes are moving to a different grid. We propose here to apply connected dominating sets (DS) as an alternative to grids. We also improved basic quorum, and applied on DS-quorum (DS based quorum) better criterion for triggering local information exchanges and global location updates, by meeting two criteria: certain distance movement and certain number of observed link changes with (DS) nodes. Backbones created by DS nodes (using 1-hop neighborhood information) are small size, do not have a parameter like grid size, and preserve network connectivity without the help of other nodes. Location updates and destination searches are restricted to backbone nodes. Both methods use ‘hello’ messages to learn neighbors. While this suffices to construct DS, grid leader (re)election requires additional messages. Simulation results show that using DS as backbone for quorum construction is superior to using grid as backbone or no backbone at all. The proposed DS-quorum location service can achieve higher (or similar) success rate with much less communication overhead than grid-based approaches.     

MANET环境下AODV协议的研究和改进

MANET网络就是移动Ad—Hoc网络，它是由若干节点所组成的一个移动自治系统，在一个无线Ad—Hoc网络中，节点之间通过多跳无线链路相互通信，所有的节点利用共享的无线媒质相互联系。这样节点之间路由问题就成为一个重点要解决的问题。目前，在这方面普遍采用DSR和AODV路由协议。但是，这两种路由协议对于要求QoS的网络来说还是力不从心的。文中主要讨论的是基于AODV路由协议的一些改进方案。     

Bit duplication technique to generate hard quadratic unconstrained binary optimization problems with adjustable sizes

Quadratic unconstrained binary optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. The main contribution of this article is to propose the bit duplication technique that can specify the number of duplicated bits, so that it can generate hard QUBO problem with adjustable sizes. The idea is to duplicate specified number of bits and then to give constraints so that the corresponding two bits take the same binary values. By this technique, any QUBO problem with $n$ bits is converted to a hard QUBO problem with $(m+n)$ bits . We use random QUBO problems, N-Queen problems, traveling salesman problem and maximum weight matching problems for experiments. The performance of QUBO solvers including Gurobi optimizer, Fixstars Amplify AE, OpenJij with SA, D-Wave samplers with SA, D-Wave hybrid and ABS2 QUBO solver are evaluated for solving these QUBO problems. The experimental results show that only a small scale of duplicated bits can make QUBO problems harder. Hence, the bit duplication technique is a potent method to generate hard QUBO problems and generated QUBO problems can be used as benchmark problems for evaluating the search performance of QUBO solvers.     

The performance impact of traffic patterns on routing protocols in mobile ad hoc networks

As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. The growing set of diverse applications developed for MANETs pose far more complex traffic patterns than the simple one-to-one traffic pattern, and hence the one-to-one traffic pattern widely used in previous protocol studies has become inadequate in reflecting the relative performance of these protocols when deployed to support these emerging applications.As a first step towards effectively supporting newly developed and future diverse MANET applications, this paper studies the performance impact of diverse traffic patterns on routing protocols in MANETs. Specifically, we propose a new communication model that extends the previous communication model to include a more general traffic pattern that varies the number of connections per source node. We study the performance impact of traffic patterns on various routing protocols via detailed simulations of an ad hoc network of 112 mobile nodes. Our simulation results show that many of the conclusions drawn in previous protocol comparison studies no longer hold under the new traffic patterns. These results motivate the need for performance evaluation of ad hoc networks to not only include rich and diverse mobility models as has been done in the past but also include diverse traffic patterns that stress a wide set of protocol design issues.     

Swarm Intelligence Based Routing with Black Hole Attack Detection in MANET

Mobile Ad hoc Network (MANET) possesses unique characteristics which makes it vulnerable to security threats. In MANET, it is highly challenging to protect the nodes from cyberattacks. Power conservation improves both life time of nodes as well as the network. Computational capabilities and memory constraints are critical issues in the implementation of cryptographic techniques. Energy and security are two important factors that need to be considered for improving the performance of MANET. So, the incorporation of an energy efficient secure routing protocol becomes inevitable to ensure appropriate action upon the network. The nodes present in a network are limited due to energy constraints and secure communication protocols. Hence, the current study proposed an energy-efficient defense scheme using swarm intelligence approach. The functioning of the proposed method was validated under NS2 simulation. The experimental results confirmed that the proposed work outperformed existing methods in terms of packet delivery ratio, average end-to-end delay and throughput.     

Providing distributed certificate authority service in cluster-based mobile ad hoc networks

Nodes in a mobile ad hoc network (MANET) are more vulnerable and there is no predefined infrastructure in such a network. Providing secure communication in these networks is an important and challenging problem. Among all proposed schemes, the model of using distributed certificate authorities (CA) based on threshold cryptography and proactive share update using a cluster-based architecture seems to be a promising approach. However, there are two issues that are not well studied in the current literature for this model: (1) how to locate enough CA servers, and (2) how to perform the proactive share update. In this paper, we propose two efficient schemes with low system overhead to tackle these two problems. Compared with existing approaches, our CA architecture provides faster CA services to user nodes at reduced system overhead. The effectiveness of our proposed schemes has been verified by extensive simulation.     

Cost-effective mobile ad hoc networks management

As there are more and more mobile devices in use, different mobile networking models such as ad hoc or mesh are attracting a large research interest. Self-organizing mobile ad hoc networks (MANET) allow devices to share their services and resources without any central administration or Internet support. In this respect they can become the backbone of the wireless grid or the gateway to existing grids. To achieve these goals, MANET management must be as effective as that of wired networks. This is, however, a challenging task due to network features like mobility, heterogeneity, limited resources of hosts and feeble communication. This paper presents a set of simple, cost-effective and resilient procedures for the basic tasks of MANET creation and management.     

Robust load-balanced backbone-based multicast routing in mobile opportunistic networks

Mobile opportunistic network (MON) is an efficient way of communication when there is no persistent connection between nodes. Multicast in MONs can be used to efficiently deliver messages to multiple destination nodes. However, because multiple destination nodes are involved, multicast routing is more complex than unicast and brings a higher communication cost. Backbone-based routing can effectively reduce the network overhead and the complexity of routing scheme. However, the load of backbone nodes is larger than that of regular nodes. If the backbone node’s buffer is exhausted, it will have a significant impact on the performance of the routing scheme. Load balancing can improve the ability of backbone to deal with the change of network load, and backbone maintenance algorithm can provide backbone robustness. In this paper, we propose a robust load-balanced backbone-based multicast routing scheme in MONs. In the backbone construction algorithm, we transform the problem of backbone construction into a multi-objective optimization problem, and propose a multi-objective evolutionary algorithm-based backbone construction algorithm, namely LBMBC-MOEA algorithm. In addition, in order to increase the robustness of the backbone-based routing scheme, we propose a localized multicast backbone maintenance algorithm (MBMA) to deal with the buffer exhaustion of backbone nodes. When a backbone node’s residual buffer is insufficient, MBMA algorithm selects other nodes to replace the backbone node. The results on extensive simulations show that when considering the node buffer size constraints, compared with previous backbone-based multicast routing schemes, our proposed algorithm has better performance, and when the node’s residual buffer is insufficient, MBMA algorithm can significantly improve the performance of the backbone-based multicast routing scheme.     

SAAMAN: Scalable Address Autoconfiguration in Mobile Ad Hoc Networks

Address autoconfiguration is one of the fundamental issues in mobile ad hoc networks (MANET). A node must need some form of identity before participating in any sort of communication. So each host in a MANET needs to be uniquely addressed so that the packets can be relayed hop-by-hop and delivered ultimately to the desired destination. Moreover, nodes in the MANET are free to move and organize themselves in an arbitrary fashion. Therefore any fixed infrastructure based solution for assigning identity (i.e. IP address) is not directly applicable to MANET. Under this infrastructureless and sporadic nature of the mobile nodes, several protocols of address autoconfiguration in the mobile ad hoc networks (MANET) have been proposed. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. In this paper, we propose an efficient and scalable address autoconfiguration protocol that automatically configures a network by assigning unique IP addresses to all nodes with a very low overhead and minimal cost. Evenly distributed Duplicate-IP address Detection Servers are used to ensure the uniqueness of an IP address during IP address assignment session. In contrast to some other solutions, the proposed protocol does not exhibit any problems pertaining to leader election or centralized server-based solutions. Furthermore, grid based hierarchy is used for efficient geographic forwarding as well as for selecting Duplicate-IP address Detection Servers. Through simulation results we demonstrate scalability, robustness, low latency, fault tolerance and some other important aspects of our protocol.     

Integrated location management and location-aided routing system for mobile ad hoc networks

We present an integrated location management and location-aided routing system for mobile ad hoc network (MANET) which organizes the MANET into a two-level routing hierarchy with the help of Voronoi diagrams. The location information of mobile nodes in a Voronoi zone is summarized using bloom filters and distributed among the location servers in the zones. In the integrated system, the destination's location is learned during routing in the overlay network of the hierarchy. Theoretical analysis and simulation results show that the proposed system reduces the routing time by about 25% over traditional location-aided routing techniques for transaction-type traffic while incurring only small management overhead and low storage requirement.