A truthful double auction for device-to-device communications in cellular networks

Data traffic in cellular networks has dramatically increased in recent years as the emergence of various new wireless applications, which imposes an immediate requirement for large network capacity. Although many efforts have been made to enhance wireless channel capacity, they are far from solving the network capacity enhancement problem. Device-to-Device (D2D) communication is recently proposed as a promising technique to increase network capacity. However, most existing work on D2D communications focuses on optimizing throughput or energy efficiency, without considering economic issues. In this paper, we propose a truthful double auction for D2D communications (TAD) in multi-cell cellular networks for trading resources in frequencytime domain, where cellular users with D2D communication capability act as sellers, and other users waiting to access the network act as buyers. Both intra-cell and inter-cell D2D sellers are accommodated in TAD while the competitive space in each cell is extensively exploited to achieve a high auction efficiency. With a sophisticated seller-buyer matching, winner determination and pricing, TAD guarantees individual rationality, budget balance, and truthfulness. Furthermore, we extend our TAD design to handle a more general case that each seller and buyer ask/bid multiple resource units. Extensive simulation results show that TAD can achieve truthfulness as well as high performance in terms of seller/buyer sanctification ratio, auctioneer profit and network throughput.

A game-theoretic resource allocation approach for intercell device-to-device communications in cellular networks

Device-to-Device (D2D) communication is a recently emerged disruptive technology for enhancing the performance of current cellular systems. To successfully implement D2D communications underlaying cellular networks, resource allocation to D2D links is a critical issue, which is far from trivial due to the mutual interference between D2D users and cellular users. Most of the existing resource allocation research for D2D communications has primarily focused on the intracell scenario while leaving the intercell settings not considered. In this paper, we investigate the resource allocation issue for intercell scenarios where a D2D link is located in the overlapping area of two neighboring cells. Specifically, We present three intercell D2D scenarios regarding the resource allocation problem. To address the problem, we develop a repeated game model under these scenarios. Distinct from existing works, we characterize the communication infrastructure, namely Base Stations (BSs), as players competing resource allocation quota from D2D demand, and we define the utility of each player as the payoff from both cellular and D2D communications using radio resources. We also propose a resource allocation algorithm and protocol based on the Nash equilibrium derivations. Numerical results indicate that the developed model not only significantly enhances the system performance including sum rate and sum rate gain, but also sheds lights on resource configurations for intercell D2D scenarios.

Robust extended Kalman filter based technique for location management in PCS networks

Provisioning of real-time multimedia sessions over wireless cellular network poses unique challenges due to frequent handoff and rerouting of a connection. For this reason, the wireless networks with cellular architecture require efficient user mobility estimation and prediction. This paper proposes using Robust Extended Kalman Filter as a location heading altitude estimator of mobile user for next cell prediction in order to improve the connection reliability and bandwidth efficiency of the underlying system. Through analysis we demonstrate that our algorithm reduces the system complexity (compared to existing approach using pattern matching and Kalman filter) as it requires only two base station measurements or only the measurement from the closest base station. Further, the technique is robust against system uncertainties due to inherent deterministic nature in the mobility model. Through simulation, we show the accuracy and simplicity in implementation of our prediction algorithm.

A simple motion heuristic for controlling mobile sinks in delay tolerant sensor networks

Optimising energy consumption in wireless sensor networks is of dominant importance. Sink mobility is introduced to deal with this problem by approaching the sensor nodes and collecting their data buffers using the less energy demanding single-hop communication. The sink route is very crucial for the data collection operation performed in the network especially when the collection requests generated by the sensors are revealed dynamically to the sink and not known ahead. This paper presents a practical motion heuristic for constructing the sink route based on the dynamic arrival of the collection requests. Three control schemes are proposed for coordinating the interaction of multiple mobile sinks collectively performing the data collection in the network. The main objective is maximising the data collected by each mobile sink while minimising the sleeping time of each sensor awaiting the collection service. Simulation results show the performance of the mobile sinks under the proposed control schemes and the impact of the motion heuristic on the sensors' sleeping time in the network.

Multicast lifetime maximization using network coding in lossy wireless ad-hoc networks

In traditional stop-and-wait strategy for reliable communications, such as ARQ, retransmission for the packet loss problem would incur a great number of packet transmissions in lossy wireless ad-hoc networks. We study the reliable multicast lifetime maximization problem by alternatively exploring the random linear network coding in this paper. We formulate such problem as a min-max problem and propose a heuristic algorithm, called maximum lifetime tree (MLT), to build a multicast tree that maximizes the network lifetime. Simulation results show that the proposed algorithms can significantly increase the network lifetime when compared with the traditional algorithms under various distributions of error probability on lossy wireless links.

Investing in knowledge, communications and training/extension for responsible aquaculture

Knowledge has always been critically important to the development of aquaculture whether we are talking about the earliest aquaculture innovations starting in Asia or the more recent challenges confronting the sector worldwide. This panel reviewed selected national and regional case studies. Key topics for discussion include knowledge production and its communication and use (e.g. in new training and extension approaches) among the changing audiences (as aquaculture continues to attract an increasing variety of new stakeholders), and dealing with a widening set of change processes in recent times, often involving a complex mix of governance and social change challenges. We go on to suggest that aquaculture policy-makers, and stakeholders in general, need to better understand knowledge processes such as knowledge translation (implementation), knowledge networks (e.g. the role of farmers’ associations) and the use of knowledge platforms and brokers, all aimed at more effective dissemination and adoption of knowledge. Knowledge management by most stakeholders will become increasingly critical to the sustainable development of aquaculture and its movement towards attaining the goals set out in the Bangkok Declaration a decade back.

Emerging wireless personal area networks(WPANs) : - An analysis of techniques, tools and threats

Wireless Personal Area Networks provide a pivotal role in local area network technology complementing traditional Wireless Local Area Network technologies. Bluetooth, ZigBee and NFC (Near Field Communications) have emerged as key WPAN technologies with UWB (Ultra Wide Band) standards currently evolving. They are however subject to the usual range of security vulnerabilities found in wireless LANs such as spoofing, snooping, man-in-the-middle, denial of service and other attacks. However security in WPANs is not as mature as it is in Wireless LANs and further work is needed in order to provide comparable protection. This paper examines a range of WPAN technologies and security issues and proposes protection mechanisms that can mitigate risk in each case. © 2012 IEEE.

Routing and privacy protection in human associated delay tolerant networks

This thesis proposes Human Associated Delay Tolerant Networks, where data communications among mobile nodes are determined by human social behaviours. Three models are proposed to handle the social attributes effect on data forwarding, the time impact on nodes’ movement and the privacy protection issue when social attributes are introduced.

A cross-layer key establishment scheme in wireless mesh networks

Cryptographic keys are necessary to secure communications among mesh clients in wireless mesh networks. Traditional key establishment schemes are implemented at higher layers, and the security of most such designs relies on the complexity of computational problems. Extracting cryptographic keys at the physical layer is a promising approach with information-theoretical security. But due to the nature of communications at the physical layer, none of the existing designs supports key establishment if communicating parties are out of each other's radio range, and all schemes are insecure against man-in-the-middle attacks. This paper presents a cross-layer key establishment scheme where the established key is determined by two partial keys: one extracted at the physical layer and the other generated at higher layers. The analysis shows that the proposed cross-layer key establishment scheme not only eliminates the aforementioned shortcomings of key establishment at each layer but also provides a flexible solution to the key generation rate problem. © 2014 Springer International Publishing Switzerland.

Chameleon hashing for secure and privacy-preserving vehicular communications

Many services and applications in vehicular ad-hoc networks (VANETs) require preserving and secure data communications. To improve driving safety and comfort, the traffic-related status information will be broadcasted regularly and shared among drivers. Without the security and privacy guarantees, attackers could track their interested vehicles by collecting and analyzing their traffic messages. Hence, anonymous message authentication is an essential requirement of VANETs. On the other hand, when a vehicle is involved in a dispute event of warning message, the certificate authority should be able to recover the real identity of this vehicle. To deal with this issue, we propose a new privacy-preserving authentication protocol with authority traceability using elliptic curve based chameleon hashing. Compared with existing schemes, our approach possesses the following features: 1) mutual and anonymous authentication for both vehicle-to-vehicle and vehicle-to-roadside communications, 2) vehicle unlinkability, 3) authority tracking capability, and 4) high computational efficiency. We also demonstrate the merits of our proposed scheme through security analysis and extensive performance evaluation.

Robust multi-factor authentication for fragile communications

In large-scale systems, user authentication usually needs the assistance from a remote central authentication server via networks. The authentication service however could be slow or unavailable due to natural disasters or various cyber attacks on communication channels. This has raised serious concerns in systems which need robust authentication in emergency situations. The contribution of this paper is two-fold. In a slow connection situation, we present a secure generic multi-factor authentication protocol to speed up the whole authentication process. Compared with another generic protocol in the literature, the new proposal provides the same function with significant improvements in computation and communication. Another authentication mechanism, which we name stand-alone authentication, can authenticate users when the connection to the central server is down. We investigate several issues in stand-alone authentication and show how to add it on multi-factor authentication protocols in an efficient and generic way.