New Publications are available for Communication network design, planning and routing
http://dl-live.theiet.org
New Publications are available now online for this publication.
Please follow the links to view the publication.Routing algorithm of WSN under interference environment
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0590
Interference is one of the most crucial factors in any wireless communication system. Dealing with it could be very complicated because of its unpredictability, but it is essential in order to deliver complete and comprehensible information to the destination. The aim of this work is to implement a routing algorithm, based on the classic AODV, which is able to find a new route to the destination in case one or more interference sources affect packets' routes. The algorithm looks for the shortest route to the destination going around the interference areas. Both static and dynamic interference sources have been considered. As demonstrated from the experimental tests, it achieves better performance than the classic AODV since the process of finding a new route is in most of the cases faster and in particular the network utilization is drastically reduced, which leads to a considerable power saving. (5 pages)The 'Saint Petersburg' effect, anomalous performance of a medium wave broadcast antenna
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0399
Conventional methods for planning radio services at medium frequencies can lead to pitfalls. ITU Recommendation P.1147 favours idealised antennas with no room for real patterns or reflection heights, which can result in anomalies going un-noticed. One idealised antenna is the anti-fade monopole, conventionally optimised assuming fixed layer height, and a perfect ground. A small residual sky-lobe is permitted at least 6 dB below the level of the groundwave, extending the fade-free range of the groundwave service area. After a medium wave transmit antenna in Estonia had been optimised to provide a service area beyond 400 km, modifications were sought to provide coverage of Saint Petersburg, 250 km away. Analysis uncovered an unusually large sky lobe, traced to phase effects between a monopole taller than λ/2 and a shorter director. Here, the cause, impact on coverage, and solutions are investigated. (5 pages)Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0611
Wireless Sensor Networks (WSNs) are used in many applications to gather sensitive information which is then forwarded to an analysis centre. Resource limitations have to be taken into account when designing a WSN infrastructure. Unbalanced energy consumption is an inherent problem in WSNs characterized by multi-hop routing and many-to-one traffic pattern. This uneven energy dissipation can significantly reduce network lifetime. This paper proposes a new routing method for WSNs to extend the network lifetime using a combination of Fuzzy approach and A-star algorithm. The proposal is to determine the optimal routing path from the source to the destination by favouring the highest remaining battery power, minimum number of hops, as well as minimum traffic loads. To demonstrate the effectiveness of the proposed method in terms of balancing energy consumption and maximization of network lifetime, we compare our approach with A-star search algorithm and Fuzzy approach using the same routing criteria. Simulation results demonstrate that the network lifetime is significantly increased by employing the proposed routing method. (6 pages)Design and comparative analysis of single-path and epidemic approaches to information and energy management in wireless sensor networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0602
Intelligent energy management is a key challenge in Wireless Sensor Networks. The choice of an appropriate routing algorithm constitutes a critical factor, especially in unstructured networks where, due to their dynamic nature, a reactive routing protocol is necessary. Such networks often favour packet flooding to fulfil this need. One such algorithm is IDEALS, a technique proposed in the literature, which balances energy consumed with information delivered. This paper evaluates the use of a single-path solution with IDEALS to increase efficiency. Simulation results comparing the two approaches show that the single-path algorithm outperforms flooding in terms of energy consumption for any network size. Furthermore the benefit of IDEALS is preserved as its combination with the single-path algorithm maximises information throughput. (5 pages)Three-dimensional route prediction algorithm based on minimal available information in wireless ad hoc sensor networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0604
In this paper we propose a three dimensional algorithm for the optimum route prediction based on minimal available information, as we have no information from node position, velocity and velocity change also transmission power. The algorithm holds capabilities to finds a proactive route prediction in wireless sensor networks and predicts link lifetime capable to capturing the remaining time for which a link can be used for efficiently routing, therefore intended to be used for optimized route construction with consideration to predict longest living link lifetime between two nodes, without adaptation of specific mobility model. We present an adaptive route prediction algorithm that accurately predicts the longest living link between nodes in wireless sensor network, as algorithm gets input from a periodically sampled data that gathered in a noisy range of two nodes of a link. (5 pages)Performance evaluation of current differential relays over a wide area network
http://dl-live.theiet.org/content/conferences/10.1049/cp.2012.0060
Progress in the development of communication network technology continues apace and Ethernet technology, once limited to local area network applications, is increasingly being considered for use as the backbone technology for wide area communication networks. The technology, most commonly referred to as “Carrier Ethernet”, seems likely to become the dominant technology within wide area networks ultimately replacing earlier generation networks based upon PDH and SDH / SONET platforms. The availability of Carrier Ethernet and in particular, in terms of the testing described here, IP/MPLS-based Carrier Ethernet now enables us to consider the application of Ethernet technology to teleprotection. (6 pages)An analysis of broadband capacities with impulse noise over residential power lines
http://dl-live.theiet.org/content/conferences/10.1049/ic.2011.0078
Transmission of broadband over power lines has received considerable attention recently to cater to broadband distribution within the premises of a home or m the local area served by a substation. The power line has a very different gauge and topology compared to traditional twisted pair copper that today has evolved substantially to support broadband over DSL. The power line has a thicker gauge and shorter straight lengths, but a large number of bridge taps with inductive load terminations. This paper addresses the dual issues of modelling typical power line channels and analyzes the resultant channel for Multicarrier Transmission The basic approach to analyze the power line channel employs ABCD parameters of the individual sections. The effect of up to 10 bridge taps over a 600 meter length is studied. Signal to noise ratio profiles have been obtained using Discrete Multitone Transmission as in ADSL2 and VDSL2 over a bandwidth of 30 MHz. The noise profiles considered include impulse noise which is predominant over power line sections, apart from AWGN. A tone loading analysis for various types of power line channels have been presented assuming the Transmit power spectral densities (PSDs) for ADSL2 and VDSL2. This analysis points to the fact that lower Transmit PSDs would suffice to match the rates achievable by xDSL over traditional twisted pan copper, and this can be distinct advantage considering the need to distribute broadband within residential premises.Black hole attack and their counter measure based on trust management in MANET: A survey
http://dl-live.theiet.org/content/conferences/10.1049/ic.2011.0087
Mobile ad-hoc network (MANET) is an autonomous system connected by mobile nodes with wireless links. Due to absence of infrastructure, MANET is used in various applications, such as battlefield, business applications, and remote areas. As, communication among the nodes is through the insecure wireless link, security is very important issue for this type of networks. MANET is vulnerable to attacks such as Black hole attack, Gray hole attack, wormhole attack, Sybil attack, and Route table modification attack. Black hole attack has serious impact on routing and delivery ratio of packets. To overcome Black hole attack, a mechanisms such as trust based routing, intrusion detection system, sequence number comparison and Data Routing Information table (DRI) has been proposed. Trust based On Demand routing mechanism identifies and decreases the hazards by malicious node in the path. This paper provides a survey of preventing and identifying Black hole attack using trust management mechanism in MANET.Multicast routing in MANET using multiple reliable rings backbone
http://dl-live.theiet.org/content/conferences/10.1049/ic.2011.0051
In this paper, we propose Multicast Routing scheme in MANET using Multiple relaible Rings backbone (MRMR) that constructs the boundary of MANET with the help of a convex hull algorithm. Multiple rings are constructed at an appropriate distance between the centroid of convex hull and the boundary. Mesh of multicast routes are established by a path that comprises of following segments: a source and its nearest ring node, sources nearest ring node to destination's nearest ring node and destination's nearest ring node to destination. Multicast routes are set up to recover routes against link failures, node failures and mobility patterns with local patch-up of failed links. MRMR outprforms in terms of control overheads, packet delivery ratio and packet delivery latency as compared to an adaptive backbone (ADB) based multicast routing for MANETs.Topology scalability and routing in homogeneous and heterogeneous access networks
http://dl-live.theiet.org/content/conferences/10.1049/ic.2011.0061
The growth in the different technologies has made us to think of integrating them, for more flexibility, efficiency, user convenient usage and still more to list. Technologies are evolving towards broadband information access across multiple networking platforms in order to provide continuous connection of multimedia services and applications. In such technologies the heterogeneous networks access (4G wireless communication) is one of them. In heterogeneous networks the radio resource management plays an important role to utilize the resource. The homogeneous and heterogeneous network has their own issues to resolve to adopt the different needs of the people. In our scheme we considered the both of them and tried resolve the resource allocation and power management issues. The scheme provides resource allocation for dynamic cellular network and keeping the LAN network static. The dynamism is considered with respect to incoming and outgoing nodes in the cellular network. The power level comparison of the nodes in the cellular networks is done to allocate the resource and accept the call.Wireless sensor network lifetime optimization
http://dl-live.theiet.org/content/conferences/10.1049/ic.2011.0090
This paper presents wireless sensor network (WSN) for environmental monitoring with optimized lifetime. The node is equipped with multimode sensors for sensing different environmental parameters. An efficient utilization of power is essential in order to use networks for long duration, hence it is needed to reduce data traffic inside sensor networks, reduce amount of data that need to send to sink. This paper aims at studying different strategies to maximize the WSN lifetime, including routing, data aggregation, data accuracy and energy consumption. The main idea is to define a multi-metrics protocol that takes into account the residual energy within sensor nodes, data aggregation and data accuracy.This paper considers three optimization metrics. First of all, it considers the construction of routing tree with energy and distance parameters.The objective is to maximize the number of data gathering queues answered until the first node m the network fails. Secondly, data aggregation is done by gathering data in an energy efficient manner The aim of the proposed work is to compare the performance in terms of energy efficiency in comparison with and without data aggregation in WSN. Thirdly, the trade-off between data quality and energy consumption to increase the lifetime of WSN is considered.Preemptive AOMDV routing for mobile Ad-hoc networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0436
An Ad hoc network will often change rapidly in topology, this courses for routes in the network to often disappear and new to arise. The Ad-hoc On-Demand Distance Vector Routing Protocol(AODV), is based on the principle of discover routes as needed. The Ad Hoc On Demand Distance Vector (AODV) routing protocol performs better than the table-driven protocol. Link failure caused by node mobility is a common feature of multi-hop, wireless ad hoc networks. With a reactive routing protocol such as AODV (Ad hoc On-demand Distance Vector), this leads to increased delay and routing overheads while route repair procedures are carried out. In this paper we will extend the definition of A OD V with the ability to discover multiple routes to a host and switch between them, if an active route is be coming weak and there is a risk that it will disappear. We will refer to it as "pre-emptive AOMDV". We will show that the performance of pre-emptive AOMDV do handle changes in topology better than AODV it self. To show the effect of extending AODV, the suggested protocol is implemented in a simulator. Performance enhancements will be presented from different scenarios, to compare pre-emptive AOMDV with the ordinary AODV.Pro-active energy management for Wide Area Networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0682
We present a methodology for achieving energy savings in excess of 30% in Wide Area Networks. The approach applies a limited set of pre-calculated network topology configurations derived via a Genetic Algorithm across the day. The GA determines the minimum set of resources required in order to support a given traffic demand. Information gleaned from SNMP trap messages, triggered by the use of a link utilization threshold, determine when to switch between configurations. The threshold employs moving average smoothing and is discretely readjusted over the course of a daily cycle based on anticipated basal load variations. By exploiting MT-OSPF this approach provides a scalable and flexible means of reconfiguring an infrastructure that avoids routing discontinuities, excessive computational effort and the exchange of considerable volumes of control information.A method to reduce the routing table size of server in electrical/optical data center network
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1358
This paper proposes a virtual hierarchical mesh network and efficient subnet agent selection method to reduce the routing table size of servers in server-only data center networks for better scalability of the network. (2 pages)Ad hoc network routing mechanism for intelligent community
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0920
Intelligent community network features low power consumption and one-way data convergence. Traditional Ad hoc network protocols have a large number of duplicate routing overhead in intelligence community, resulting in unwanted energy loss. This paper presents a hop-count routing mechanism based on-demand routing, limiting the number of routing overhead. Analysis and simulation shows that the routing mechanism has less overhead than traditional routing and more balanced energy consumption, which meets the need of intelligence community.Novel optical techniques for lightpath tracing and monitoring in all-optical reconfigurable wavelength routing networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1317
A lightpath tracing scheme based on prime-number-encoded tags is proposed for all-optical reconfigurable wavelength routing networks. All traversed network nodes along the lightpath of a received optical packet can be identified at the destination node. (2 pages)A cross-layer approach for neighbor discovery in opportunistic networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0946
In opportunistic networks, the Epidemic Routing (ER) protocol can offer a reliable way to transmit data. However, it has some extra latency in neighbor discovery. To address the problem, we propose a cross-layer approach to sense encountered nodes more quickly, which utilizes HELLO packets instead of the IMEP protocol to sense neighboring nodes, speeds sensing encountered nodes through cross-layer overhearing in MAC layers, and varies the period of HELLO packets to diminish unnecessary delivery of control packets. Results obtained from a series of simulation experiments show that our proposed approach outperforms the classical Epidemic Routing protocol and one of its present improvements in terms of the time of neighbor discovery and end-to-end packet delay.Adaptive congestion avoidance scheme based on reinforcement learning for wireless sensor network
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0664
Energy efficiency and QoS-aware are the key issues of wireless sensor network (WSN). In this paper, we proposed a congestion avoidance scheme devoting to efficient use of energy and adaptive maintain well QoS quality by self-adapt routing. Because it is difficult to obtain the state of network energy and QoS in a practical condition, we are motivated to utilize reinforcement learning to obtain the routing strategy in multi-path communication of WSN. We extend the R-learning algorithm to solve the difficulty of the nodes obtaining the network's status information. We compare the proposed scheme to other congestion avoidance protocols, such as CR. The simulation results show that the performance of our schemes is prior to existing ones.Distributed PMIPv6 based on the prefix aggregation
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1434
IETF has proposed a promising network-based mobility management method, called Proxy Mobile IPv6 (PMIPv6), which does not require any participation of mobile hosts in mobility-related signaling. However, it remains an open issue how to deploy the PMIPv6 while keeping optimized path route and low signaling costs. In this paper, we propose a Distributed PMIPv6 scheme based on the Prefix Aggregation, namely DPPA. In DPPA, all the LMAs in the extended home network are connected to each other via the global tunnel and announce their aggregated prefix to the Internet. Besides, by using the IP anycast routing, the signaling messages and data packets destined to any IP address that belongs to the aggregated prefix can be transmitted to the topologically closest LMA. Our analysis results show that DPPA has a more optimized path and lower location update cost and packet transmission cost when compared to PMIPv6.Reliable data transmission against packet dropping misbehavior in wireless ad hoc networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0922
Many routing protocols in MANET have been proposed to resist packet dropping attacks by removing suspicious node from route. However, when they cannot discovery who is an adversary, they cannot effectively deal with packet dropping attacks launch by the adversary. In other words, when there is anyone type of packet dropping attacks they cannot resist, the packet delivery rate will be influenced. In view of this, we propose a novel scheme to mitigate the influence of any kind of packet dropping attacks in MANET. Further, our scheme can cooperate with other protocols to acquire better packet delivery rate and to decrease overheads. The security analysis and simulation study in this paper verify the effectiveness and efficiency of our scheme.Adjusting electrical downtilt based mechanism of autonomous cell outage compensation
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0697
Automatic cell outage compensation is the key technology of self-managed network, which is a functionality aiming to automatically mitigate outages that occur in radio networks due to unexpected failures. However, there are few detailed mechanisms to automatically compensate the coverage hole of the outage cell. In this paper, an adjusting electrical downtilt based mechanism of cell outage compensation in wireless access network is presented. It compensates the coverage hole by automatic adjustment of electrical downtilt in surrounding cells in order to meet the operator's performance requirements based on coverage and capacity to the largest possible extent. The experiment results show that the proposed mechanism is practicable and efficient. It could effectively and automatically compensate the coverage of cell in outage without pilot pollution, and impair the QoS as little as possible.A self-optimizing load balancing scheme for fixed relay cellular networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0680
Load balancing (LB) aims at tackling the hot-spot cell problem caused by uneven load distribution and resources shortage. Traditional LB schemes mainly focus on the load reduction of the hot-spot cell, while some partner cells might suffer from aggravating load after receiving inappropriate traffic, which triggers ripple LB and reduces the LB efficiency. To deal with this problem, a self- optimizing LB scheme in fixed relay station (RS) cellular networks is proposed. In the scheme, partner cells share the load jointly to guarantee each partner has similar load after LB. Meanwhile, the partner response mechanism considers the resources usage of partner's RSs to further reduce the ripple LB. Simulation results show that the proposed scheme can effectively reduce the number of ripple LB and reduce the call blocking rate.Online traffic engineering by optimizing inbound traffic in locator/identifier separation context
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1495
To cope with the scalability issue of current Internet inter-domain routing system, several proposals addressing identifier and locator separation are proposed recently. LISP is one of them. In a LISP-capable network, when end-system identifier (EID) is not routable, a mapping system must map an EID to a routing locator (RLOC). By optimizing EID-RLOC Mapping Assignment (ERMA) for an AS, inbound traffic can be optimally distributed in the AS. In this paper, ERMA optimization problem is studied. We introduced an online ERMAO scheme based on delay information of probe packets. Simulation results show that online optimizing ERMA can achieve better network performance, e.g., lower packet delay and maximum link utilization.Simulation of broadcasting algorithm using eighbor information in mobile ad hoc networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0496
This paper develops novel broadcast algorithms for mobile ad hoc networks to improve efficiency and provide guarantee for full delivery of broadcasting. An important objective is to reduce broadcast redundancy and to avoid the broadcast storm problem. It proposes two broadcasting algorithms such as, Sender based algorithm and Receiver based algorithm. The proposed Sender based algorithm selects subset of forwarding nodes using 1-hop neighbor information. It can reduce both the computational complexity of selecting the forwarding nodes and the maximum number of selected nodes in the worst case. The proposed receiver based broadcasting algorithm can significantly reduce redundant broadcasts in the network. It decides whether or not to broadcast the message. The probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The receiver based algorithm uses the Responsibility based scheme which further reduces the redundancy. The proposed algorithms improve the efficiency and also guarantee full delivery.Multi-user cooperative diversity for energy conservation in green mobile networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0667
In recent years, green communication has been studied as a promising technology to conserve energy consumption, reduce radio emission and ensure sustainable development of wireless communication systems. A green mobile network will be integrated with the state-of-art advanced wireless networking technologies to fulfill end-to-end green communications. Cooperative communication has been widely utilized to significantly improve system performance and decrease power consumption. In this paper, we utilize cooperative relay to conserve energy consumption in green mobile networks. The relay selection and power allocation are investigated. The theoretical analysis is carried out under different number of cooperative users. We derive the explicit expression of energy consumption for the Amplify-and-Forward (AF) protocol with multiuser diversity. Simulation results demonstrate that the proposed relay selection and power allocation schemes significantly reduce energy consumption in green mobile networks.Urgency-based packet scheduling and routing algorithms for video transmission over MANETs
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0919
In this work, we present urgency-based packet scheduling and routing algorithms to effectively deliver delay-sensitive video data over mobile ad hoc networks. First, packet urgency, node urgency, and route urgency are defined based on the end-to-end delay requirement and the number of hops over a route. Based on these urgency metrics, the packet scheduling algorithm determines the packet transmission order and the packet drop policy at each node to maximize the number of packets delivered under the maximum tolerable end-to-end delay, and the routing algorithm establishes a route to minimize the route urgency over the entire network in order to satisfy the end-to-end delay requirement. Finally, experimental results are provided to show the performance of the proposed algorithm.A service composition selection method based on sharing routing in wireless sensor networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1425
Service composition system in wireless sensor networks treats software components provided by sensors as services. Most research into prolongation of uptime of sensor networks is based on adaptive mechanism at the MAC layer and physical layer to minimize the energy consumption and do not consider integration of services requirement and energy of sensor nodes. In this paper we present a novel resource-aware service composition selection method based on sharing routing in WSNs. This method integrates service requirement and sensor networks status as a whole at the service selection stage. This approach improves the ability to mutual perception between service and sensor networks. The performance of sharing routing service composition selection method in WSNs is evaluated.End-to-end energy efficient communication
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0683
Awareness of energy consumption in communication networks such as the Internet is currently gaining momentum as it is commonly acknowledged that increased network capacity (currently driven by video applications) requires significant more electrical power. This paper stresses the importance of approaching the problem is a coordinated manner looking at all part of the end-to-end system as a whole.A security enhanced network architecture for future networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1456
Security is one of the most urgent problems in today's Internet. For the lack of a clear definition of identifier of entity we seek to manage in the Internet, existing security mechanisms are not well integrated into the Internet architecture. These security mechanisms are designed as separate extensions and their effectiveness are limited. In this paper, we present a new network architecture, Security Enhanced Network Architecture (SENA), to provide a "built-in" security. In SENA, there are four identifiers, including service identifier, connection identifier, endpoint identifier and routing identifier. With a reinforced control plane, the architecture allows network administrators directly manage the mappings between different identifiers and provides security as an integrated solution.Multicast resource allocation scheme with QoS guarantee in SFN
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0663
We propose a multicast resource allocation scheme in single frequency networks to maximize the total rate while guaranteeing quality-of-service (QoS) requirement of real-time service. In this scheme, we first design a user connection control algorithm to reduce feedback load. The algorithm determines to which base stations users should feedback channel state information. We then formulate a joint subcarrier and power allocation issue and find that it has high complexity. Hence, we first distribute subcarriers and propose proportional allocation strategy to achieve tradeoff between fairness and QoS. Next, an iterative water-filling power allocation is proposed to fully utilize the limited power. To further decrease complexity, fixed power iterative scheme is introduced. Simulation results show that the proposed scheme greatly improves system performance while reducing 83% of the feedback overhead. Besides, the fixed power iterative strategy is suitable for practical system due to low complexity.A novel route selection strategy in decode-and-forward relay enhanced LTE-A network
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0696
Decode-and-forward (DF) relay has been proposed as a promising technique in LTE (Long Term Evolution)-Advanced to expand cell coverage and improve system performance. Due to the large discrepancy between uplink and downlink capabilities of donor eNodeB (eNB) and Relay Node (RN), the conventional strategies which are based on downlink optimisation lead to some users connecting to the nodes which provide better downlink performance but poorer uplink performance. In this paper, a new route selection strategy is proposed, which considers uplink and downlink jointly. The proposed route selection strategy is compared with a conventional strategy based on downlink spectrum efficiency. Simulation results demonstrate the advantages of the proposed strategy in enhancing system uplink throughput and increasing user's uplink spectral efficiency with no or little degradation of downlink performance.A star low-power wireless sensor network design and analysis
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0949
In order to solve data collection and transmission problem of smart home, a low-power wireless data acquisition star topologic network was designed, and a star topologic network communication protocol was given. Using queuing theory, the establishment of M/M/l model analysis was carried out. By analyzing the time prediction of adjustment period, sensor capacity and power calculation of stationary period, power system disturbances of added sensor and other problems, detailed analysis of the power consumption of the system was carried out, and calculation methods were given. The experiment proved that the system normal working hours exceeds 5 months, which meets low power consumption, the real-time data acquisition and accuracy requirements demand.Solid end-to-end probing and analysis method for estimating network loss
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1481
Overlay network monitoring is one of the most important issues in the design and operation of overlay networks. It faced with increasing demand for better throughput and response time performance. Given an overlay network with n end hosts, existing systems either require O(n<sup xmlns="http://pub2web.metastore.ingenta.com/ns/">2</sup>) measurements, and thus lack scalability, or can only estimate the latency but not failures or congestion. We propose a scalable deterministic network monitoring scheme that selectively monitors k linearly independent paths which can fully describe all the O(n<sup xmlns="http://pub2web.metastore.ingenta.com/ns/">2</sup>) paths. We use the loss rates and latency of the collected k path to deduce the loss rate and latency of the rest paths. Our method only assumes knowledge of the underlying IP topology, with links dynamically varying between normal and lossy. In this paper, we propose a novel path loss rate inference algorithm which improves, implements and extensively estimates such a monitoring method. We carry out our experiments in two different scenarios and the results from the experiments demonstrate that our approach increases accuracy in monitoring congested paths compared to other representative schemas'. Especially in a router-level topology, our approach can deliver almost a 12.5% increase.Optical crosstalk calculation technique for novel photonic network simulator
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1313
This paper describes the crosstalk calculation technique to enhance the simulator that enable future wavelength routing networks design including power budget, fiber dispersion, and ASE noise. (2 pages)An enhanced routing mechanism based on ZRP in ad hoc networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0931
Ad hoc networks are of great use from military applications to emergency management, providing the aid to deal with affairs that happen in hostile environment. ZRP is a hybrid routing protocol used in ad hoc networks, which proactively keeps routing information within the routing zone and reactively bordercasting query and message packets to external zones, so that routing in ad hoc networks will be more efficient. However, the cost in delays and overhead is also a big obstacle in improving the performance of ZRP. Thus, in this paper, we introduce a new mechanism of routing mechanism. This mechanism selects key nodes in routing to find destination node. With modelling and simulation, we have proved that the enhanced routing mechanism we propose is convincing.RCNC: reducing complexity of network configuration
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1432
In this paper, we address the issue of reducing intra-domain network configuration. To achieve this, we design an OSPF based routing protocol, named Reducing Complexity of Network Configuration (RCNC), which works with DHT based Identifier(ID)/Locator split routing mechanism RCNC router automatically generates Router ID for itself, and creates Router ID based routing table by exchanging link-state advertisements (LSA) with others, without configuring IP and subnet mask on the interface that links with other routers. Meanwhile, the ID/Locator split based routing mechanism ensures the RCNC routers backward compatible with existing hosts. Evaluation results show that in 10 actual ISPs, RCNC reduces an average of 13.3 items of intra-domain configuration per router when the total number of configuration reduction is minimum, and 6.8 items when the total number is maximum. Meanwhile, comparing with the existing routing protocol, in the 10 ISPs, RCNC reduces intra-domain routing entries by 67.5% on average when the number of entries is minimum and 27.5% on average when the number is maximum. Through the NS-2 simulation, we can observe that the control overhead of RCNC only increases by 1.9% than that of OSPF.Improved deployment of wireless sensor networks in the intelligent building
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1433
With the exponential growing of various applications, wireless sensor networks have attracted a great deal of interest in recent years. However, deploying wireless sensor networks into practical environments requires different deployment strategies owing to the complex application conditions. In this paper, a complete study for the implementation of wireless sensor networks in the intelligent building is presented. We carry out some experiments to study the characteristics on the environment of intelligent buildings before deploying the actual system. Several vital parameters of wireless sensor networks are measured, such as Package Loss Rate (PLR), Link Quality Indicator (LQI) and Round-Trip Time (RTT), and then, we analyze the details of the deployment scheme in the intelligent building based on the results of these tests. At the end of the paper, we propose an optimized deployment strategy of the system to improve the performance of the sensor networks. And several evaluation results show that the presented system can satisfy the requirements of the applications in the intelligent building.Sizing buffer of router with pacing mechanism
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0674
Pacing mechanism reduces the traffic burst in the network and it also decreases the router buffer size in the link with only TCP flows. In this paper, it is investigated in full scale the performance of the bottleneck link with both TCP and TFRC flows while changing the router buffer size. The results show that, with paced TCP traffic, small router buffer are sufficient to achieve link utilization level above 90% with reasonable loss rate. In addition, the fairness is of high degree when the bottleneck link is shared by TCP and TFRC flows.A cross layer routing protocol for green communication network
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0802
Nowadays, the idea of green communication has been widely discussed to improve the green performance of communication network. Routing is a key issue to reduce the energy consumption of the network. In this paper, we propose a cross layer routing protocol. With the constraint of BER and request rate, the protocol can optimize the adaptive modulation, power control, routing protocol jointly. The simulation results show that the proposed protocol can improve the performance of routing by 15 percent.A fast handover management scheme for mobile identifier/locator separation networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1476
Several researches propose the identifier/locator separation architecture to address the scaling problems of today's Internet routing and addressing system. And scalable and seamless mobility support is an important task in mobile identifier/locator separation networks. In this paper, by analyzing the features, such as direct separation, flexible mapping and identifier replacement, we show that the new architecture delivers data packets more efficiently and protects location privacy better than traditional mobile IP networks, and is convenient to implement soft handover. Then we present a fast handover management scheme for the new architecture, which improves the reactive handover mode of FMIPv6 and eliminates the duplicate address detection (DAD) and return routability (RR) processes in MIPv6. The numerical results show that the scheme has good scalability and low handover latency, and has great advantages in the signaling cost and fast mobility support.A low-power FIS mechanism and energy analysis for green router
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1466
With the development of the next generation internet, the existing router architecture faces many problems, such as performance, complexity and power consumption. With the increasing of network size, how to implement a low-power forwarding is a challenge in green and high-performance router designing. In this paper, we consider building a FIS mechanism based forwarding in switching idea. The memory requiring and accessing reduced by blurredly forwarding and piping switching. Energy model of FIS and FBS is established. Experiments using real-life routing tables demonstrate that our FIS solution can reduce the power of routing lookup 12.5% than FBS clearly.A modified AODV routing protocol based on route stability in MANET
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0959
The highly dynamic topology changes caused by quick and random node mobility make the existing wired routing protocol unsuitable for mobile ad-hoc network (MANET). AODV protocol is proposed for this highly mobile network, but AODV only saves the least hops path to the destination. When the link breaks, it needs to rediscover the route that increase network overload. In this paper, we devise the conventional AODV and propose a new modified AODV routing protocol called MAODV which takes route stability into consideration to attempt to establish a more stable path between the source and destination. In MAODV, we make some changes in Hello and RREQ message format to respectively record the sending time and route stability factor. We use network simulator-2.30 to simulate both the AODV and MAODV protocols in the similar scenario. Simulation results comparison and analysis are made to evaluate the effectiveness of the MAODV and we find that the MAODV shows a better performance in some ways.A record-based retransmission policy on SCTP's concurrent multipath transfer
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1429
Concurrent Multipath Transfer (CMT) uses the SCTP's multi-homing feature to distribute data across multiple end-to-end paths in a multi-homed SCTP association in order to achieving a more benefit cumulative throughput. Using CMT to transfer content-rich streaming media in the Ad hoc network will result in loss rate occurred and changed frequently on paths, and then the loss data need be retransmitted via a certain retransmission strategy. There are five retransmission strategies addressed for destination selecting in CMT. But in the current five retransmission strategies, paths' previous statuses are omitted during selecting destination for retransmission. In fact, paths' historical status can play an import role for paths selecting. In this paper, an improved scheme named RTX_LR is proposed based on paths' historical timeout records. And the average throughput is used as measure metric as well. A demonstrate using simulation is provided showing how receiver buffer (rbuf) blocking is reduced, and average throughput of a rbuf- constrained CMT association could benefit from proposed scheme.Mixed regenerator placement and routing and wavelength assignment for energy-efficient optical transport networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1362
We discuss network design algorithms to minimize the power consumption of an optical transport network with joined optimization of mixed regenerator placement and routing and wavelength assignment. The performance of the algorithms is investigated with simulations in various network topologies. Simulation results indicate that the algorithms can effectively reduce the number of O/E/O 3R regenerators, leading to less power consumption on signal regeneration and green network design. (2 pages)Automatic network topology discovery of EPON+EOC through SNMP
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0909
The network topology discovery is a part of network management and the basic of other network management functions. In the paper, by means of the data nodes defined in the national standards, a SNMP- based network discovery algorithm serving for the EPON+EOC (Ethernet Passive Optical Network + Ethernet over Coaxial cable) access networks is proposed and implemented. The method only needs SNMP (Simple Network Management Protocol) supported by CLT (Coaxial Line Terminal) and uses MIB (Management Information Base) informations stored in CLT, while other network devices are not requested. And we will find network devices and connectivity relationships.The cognitive mobility management based on the identifier/location split mechanism
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1423
The mobility management of the traditional Internet consists of the location management and handover management to support movement of space and time. While with the introduction of the cognitive radio technology, the mobility management has to consider the location management, handover management, and spectrum management to deal with the mobility of space, time and spectrum. Furthermore, the cognitive radio allows the cognitive user can access to different frequencies and networks, which results in the interconnection problems due to the different network architectures. In this paper, we investigate the recent development of the new Internet architecture and mobility management, and propose a mobility management scheme in the cognitive Internet based on the Identity/Location Split (ILS) mechanism. The proposed scheme takes the cognitive mobility management as the single-interface heterogeneous handover problem, and adopts the AID (Accessing Identifier) and RID (Routing Identifier) to separate the identity and location of the traditional IP, and introduces the global mapping mechanism to maintain the relationship between the AID and RID to realize the mobility support for space, time and spectrum.Coexistence studies for LTE-FDD with TD-LTE in the band 2500-2690 MHz
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0701
The frequency band 2500-2690 MHz partly being planned for TD-LTE system in China draws more and more attention especially for total spectrum planning. Therefore, Studies on the technical issues associated with mixed TDD/FDD frequency arrangements band are carried out by different countries and international organizations. This paper presents sharing study for mixed structure based on the Monte Carlo simulation. What's more, it also gives the simulation results of the impacts on the system performance in different scenarios. The conclusion enhances spectrum efficiency and utility and ensures both systems launch harmoniously in this frequency.SPSA: shortest path selection algorithm to solve the unnecessary hop problem in LISP-DHT
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.1472
LISP-DHT is a mapping system to support LISP. It is based on widely used DHT. LISP-DHT takes full advantage of the benefits of DHTs such as robustness, scalability and security etc. However, it achieves poor lookup efficiency due to the "Unnecessary Hop" problem. The unnecessary hop problem leads to a query message may traverse the same physical node multiple times, thus it heavily weakens the throughput and lookup efficiency of the mapping system. In this paper, we identify the issues with LISP-DHT which leads to "UH" problem and poor lookup efficiency. We propose the shortest path selection algorithm to solve the UH problem. The theory analysis and simulation results show that the SPSA can solve the Unnecessary Hop problem so as to improve the lookup efficiency of LISP-DHT.Analysis of multiple shared channel cooperative routing in OFDM based wireless networks
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0870
Diversity techniques have long been used to combat the channel fading in wireless communications systems. Recently cooperative communications has attracted lot of attention due to many benefits it offers. Thus co operative routing protocols with diversity transmission can be developed to exploit the random nature of the wireless channels to improve the network efficiency by selecting multiple cooperative nodes to forward data. In this paper we analyze and evaluate the performance of a novel routing protocol with multiple cooperative nodes which share multiple channels. Multiple shared channels cooperative (MSCC) routing protocol achieves diversity advantage by using cooperative transmission. It unites clustering hierarchy with a bandwidth reuse scheme to mitigate the co-channel interference. Theoretical analysis of average packet reception rate and net work throughput of the MSCC protocol are presented and compared with simulated results.A power control algorithm for tv white space cognitive radio system
http://dl-live.theiet.org/content/conferences/10.1049/cp.2011.0728
The digital switchover plan in the UK, expected to be completed in 2012, is capable of freeing up a total of about 240MHz TV bandwidth. This includes the license-exempt access to TV White Spaces (TVWS) as defined in IEEE 802.22 standards for Wireless Regional Area Network (WRAN). In this paper, a simulation model based on the existing keep-away region algorithm is established and verified to explore the potential TVWS resources with the Cognitive Radio technology at any given location in the UK. The proposed power control algorithm based on the maximum allowed transmission power is to replace the keep-away region algorithm and improve the availability of a cognitive radio (CR) operation. Finally, a comparison between these two algorithms is made in terms of system capacity.