Search

The employees, as stakeholders of the organization, can contribute to the development and productiveness of the organization. In regards to satisfaction/dissatisfaction, the opinion of employees can perform dual rule. Firstly, it supports the organization to plan future strategies and enhance their yield; secondly, it can be helpful for aspirants in seeking their best choice. In this concern, we have classified the reviews of employees using two different modules. In the first module, we have experimented on ratings of reviews; then in the second module, the textual part of the reviews is used to classify employees as satisfied/unsatisfied. After that, the reasonable outcomes of both approaches are unified for the final prediction of reported reviews as proper/improper. For this purpose, we have implemented a purely supervised machine learning approach. The performance of state of the art classifiers along with TF-IDF (Term frequency-Inverse document frequency) and BoW (Bag-of word) is analyzed in the text module. In this comparison, ETC (Extra tree classifier) performed best in terms of accuracy in both modules. It shows 100% accuracy with rating and 79% accuracy with the textual part. Ultimately, we have implemented AND gate for the evaluation of proper/improper reviews. The results of AND gate evaluate that 76% of the reviews of employees are reported as properly and 24% are reported as improperly in the used dataset.

Cyber-physical system (CPS) provides a well-organized integration between communication , computation , and control (3C) technologies. CPS has been widely used in the vehicular networks and it requires to discover multimodal data from the physical system to make appropriate decisions and actions, for example, congestion warnings, applying brakes, adjusting speed limits, etc. Information discovery and availability at individual network elements is one of the fundamental foundations of CPS. In this paper, we proposed two multimodal network information discovery schemes for vehicular CPS using the Named Data Networking (NDN). One of the proposed schemes simply modifies the pull-based NDN communication mechanism to discover multimodal multi-hop data from the network and the other scheme uses the Interest broadcast suppression (IBS) mechanism. The proposed Interest broadcast suppression scheme adapts the holding time technique to defer the Interest forwarding and its computation involves the hop-count, distance, and other network parameters. Simulation results show that the proposed schemes discover about 172 and 162 percent more multimodal information from approximately 283 and 210 percent more network area by suppressing approximately 50 percent of the Interest broadcast storm in highway and the urban traffic scenarios, respectively.

In this paper, the superframe structure of IEEE 802.15.4 standard is improved to meet the adaptive data traffic requirements of hierarchical Wireless Sensor Networks (WSNs). In the IEEE 802.15.4 standard, sensor nodes send their data implicitly by using the Guaranteed Time Slots (GTS) to their PAN coordinator. The standard does not meet the adaptive data requirements of GTS requesting nodes. If requesting GTSs in an active period are more or less than the available limit, then either the requested nodes will not be entertained or GTSs remain underutilized. Consequently, it may cause unnecessary delays or poor GTS utilization. In this work, an Enhanced Superframe offering Adaptive Duty cycle (ESAD) is proposed. ESAD adapts the active period in accordance with the requested data. In addition, the actual size of GTS has been halved to accommodate more GTS requesting nodes. The shortest job first algorithm is applied to scrutinize the requested GTS nodes. Simulation results verify that the proposed scheme increases the link utilization, improves the data transmission, reduces the delay, and allows more nodes to transfer their data in a specified superframe.

Large number of services and heterogeneity of the objects have made Internet of Things (IoT) a complex paradigm. It is necessary to placate the requirements of quality of service metrics for IoT model of urban development. Rapid delivery and continuation of services to the customers without delay, is first and foremost requisite. Applications of IoT, require service centered IoT model which should be stable, scalable, energy efficient and re-configurable. This paper, proposes a service oriented cross layer solution for IoT–QoS architecture. In the three layer model, QoS module at the application layer exploits the optimization by exhausting the acquaintance of each component. Network layer deals with the issues of transmission of packets in energy efficient manner where stability plays a crucial role for the heterogeneous objects. Resources are allocated and reallocated to the requested services in optimal way at sensing layer. The proposed IoT–QoS model for urban development applications is capable of optimizing the traditional methods and encases the network lifetime by minimizing the energy consumption.

Effective resource allocation has always been one of the serious challenges in wireless communication. A considerable number of machine type communication (MTC) devices in 5G with variable quality of service (QoS) aggravates this challenge even further. Existing Resource allocation schemes in MTC are usually considering signal to noise ratio (SNR), which provides preference to MTC devices based on distance rather than their QoS requirements. This paper proposes a resource allocation scheme with dynamic priorities for MTC devices with multiple radio access technologies (RATs). The proposed resource allocation scheme has two main parts namely medium access and resource allocation. The medium access leverages the broadcast nature of wireless signal and MTC devices’ wait time to assign priorities using capillary band in a secure and integral way. At resource allocation, SNR, total induced transmission delay, and transmission-awaiting MTC devices are used to assign resources in the cellular band. The rumination of two-staged dynamic priorities in the proposed scheduling scheme brings significant performance improvements in outage and success probabilities. Compared to SNR-based schemes, the proposed mechanism performs well by expressively improving the outage and success probability by 20% and 30%, respectively.

Conventionally, a node or vehicle in the Named Data Networking (NDN) sends an interest packet to discover information and receives a single data packet in response. However, in the case of named data Vehicular Cyber-Physical System (VCPS), a vehicle may require content from multiple vehicles in the network. Therefore, NDN forwarding daemon must receive multiple data packets in response to a single interest. Moreover, the data broadcast storm worsens in the named data VCPS due to the broadcast nature of the wireless link. In this letter, we propose the data packet broadcast suppression method for any multisource content discovery in VCPS. The proposed scheme distributively selects the potential data forwarding vehicles based on the neighbor distance, node density, and the closeness to the data forwarding line of sight. Our simulation results show that the proposed scheme alleviates 55% data traffic, 17% average per-hop delay, and achieves 7% more data discovery ratio.

The Internet-of-Things (IoT) is the future of the Internet, where everything will be connected. Studies have revealed that fog/edge computing-based services will play a major role in extending the cloud by carrying out intermediary services at the edge of the network. Fog/edge computing-based IoT’s (FECIoT) distributed architecture enhances service provisioning along the Cloud-to-Things continuum, thereby making it suitable for mission-critical applications. Furthermore, the proximity of fog/edge devices to where the data is produced makes it stand-out in terms of resource allocation, service delivery, and privacy. From the business perspective, FECIoT will lead to a boom and spring up of small-to-medium-sized enterprises, thereby encouraging inclusion for all. To this end, we present a comprehensive survey on state-of-the-art IoT literature over the period 2008–2018 and propose the FECIoT framework which covers the enabling technologies, services, and open research issues. A tutorial approach is employed, progressing from basic to more advanced concepts within the IoT domain. Lastly, we show how FECIoT can be deployed in real-life cyber-physical systems, such as the intelligent transportation system, smart grid, smart health-care, smart homes, and smart environment.

Free and fair elections are indispensable to quantify the sentiments of the populace for forming the government of representatives in democratic countries. Due to its procedural variation from country to country and complexity, to maneuverer, it is a challenging task. Since the Orthodox paper-based electoral systems are slow and error-prone, therefore, a secure and efficient electoral system always remained a key area of research. Although a lot of literature is available on this topic. However, due to reported anomalies and weaknesses in American and France election in 2016, it once again has become a pivotal subject of research. In this article, we proposed a new secure and efficient electronic voting scheme based on public key cryptosystem dubbed as Number Theory Research Unit (NTRU). Furthermore, an efficient and robust three factors authentication protocol based on a personalized memorable password, a smartcard, and bioHash is proposed to validate the legitimacy of a voter for casting a legal vote. NTRU based blind signatures are used to preserve the anonymity and privacy of vote and voters, whereas the proficiency of secure and efficient counting of votes is achieved through NTRU based homomorphic tally. Non-coercibility and individual verifiability are attained through Mark Pledge scheme. The proposed applied electronic voting scheme is, secure, transparent and efficient for large scale elections.

Underwater Wireless Sensor Networks devices are usually battery powered and thereby their lifetime is limited. This issue leads to lose data measurements and thus to a performance loss of the underlying UWSN application. It also increases the maintenance cost in Internet of Underwater Things scenarios with a huge number of UWSN devices. Additionally, the unique characteristics of UWSNs pose several constraints such as the high energy consumption, long propagation delay, and node mobility. Duty Cycle management is one of the key technologies to solve this issue. In this context, the use of duty cycle based algorithms for opportunistic, autonomous and energy efficient duty cycle management can mitigate the undesirable impact of underwater communications, consequently, improve the overall efficiency of the algorithms designed for the UWSNs. In this article, we study the energy efficient data collection for asynchronous duty cycle MAC protocols for underwater sensor networks. To this end, we improve two previously proposed receiver initiated MAC protocols that use a nodes, (1) residual energy, and (2) its sleep-awake pattern to improve the overall network lifetime. We show that the considerations made in the protocols have a great impact on the performance of the network. Our results show that the protocols minimize the collisions while alleviating the need for excessive handshake and also the average active time of a node is minimized.

Cyber adversaries have moved from conventional cyber threat to being advance, complex, targeted and well-coordinated attackers. These adversaries have come to use Advance Persistent Threat vectors to penetrate classified and large business organizations network by various evasive cyber techniques. This paper presents a systematic review of literature work carried out by different researchers on the topic and also explicates and compares the most significant contributions made by them in this area of APT. The paper addresses the shortfalls in the proposed techniques which will form the areas for further research.

Named Data Networking (NDN) uses the content name to enable content sharing in a network using Interest and Data messages. In essence, NDN supports communication through multiple interfaces, therefore, it is imperative to think of the interface that better meets the communication requirements of the application. The current interface ranking is based on single static metric such as minimum number of hops, maximum satisfaction rate, or minimum network delay. However, this ranking may adversely affect the network performance. To fill the gap, in this paper, we propose a new multi-metric robust interface ranking scheme that combines multiple metrics with different objective functions. Furthermore, we also introduce different forwarding modes to handle the forwarding decision according to the available ranked interfaces. Extensive simulation experiments demonstrate that the proposed scheme selects the best and suitable forwarding interface to deliver content.

Everyone is in the need of accurate and efficient information retrieval in no time. Search engines are the main source to extract the required information, when a user search a query and wants to generate the results. Different search engines provide different Application Programming Interface (API) and Libraries to the researchers and the programmers to access the data that has been stored in servers of the search engines. When a researcher or programmer search's a query by using API, it returns a Java Script Orientation Notation (JSON) file. In this JSON file, information is encapsulated where scraping techniques are used to filter out the text. The aim of this paper is to propose a different approach to effectively and efficiently filter out the queries based on text which has been searched by the search engines and return the most appropriate results to the users after matching the searched text because the previous techniques which are used are not enough efficient. We use different comparison techniques, i.e. Sequence Matcher Method and then compare the results of this technique with relevance feedback and in the end we found that our proposed technique is providing much better results.

In this paper, we propose a distributed interest forwarder selection (DIFS) scheme that mitigates the interest broadcast storm in vehicular named data networks. In DIFS, a vehicle sends an interest packet piggybacking its location, distance to the neighbors, and speed. In this case, the immediate neighbors do not have the requested content and rank themselves to be an eligible interest forwarder by using multiple attributes. Additionally, every intermediate vehicle uses a digital map to be selected as forwarders in both (forward and backward) directions of the consumer. Simulations show that DIFS satisfies more interest packets with less delay as compared with the recent forwarding solutions.

Connected car technology (also referred to as VANET) has gradually paved its way to legislation in several countries and soon will be followed by mass-scale deployment. However, the race between the advancements in technologies and utilization of the available resources have left a question mark on the future of pure VANET. Therefore, the research community together with academia and industry have foreseen the evolution of VANET into VANET-based clouds. The data- or content-centric communication paradigm is the point of convergence in these technologies because the content is shared among different nodes in different forms such as infotainment or safety. However, the current IP-based networking is not an ideal choice for content-centric applications because of its larger overhead for establishing, maintaining, and securing the path, addressing complexity, non-scalability for content, routing and mobility management overhead, and so on. Therefore, the limitations and shortcomings of current IP-based networking and the need for efficient content delivery advocate for a paradigm shift. To this end, a new content-centric networking paradigm, namely NDN, has been employed to address the aforementioned issues related to content-centric networking while using IP-based networking. In this article, we foresee the integration of VANET-based clouds with NDN called NDN-VC for reliable, efficient, robust, and safe intelligent transportation systems. We particularly aim at the architecture and concise naming mechanism for NDN-VC. Furthermore, we also outline the unique future challenges faced by the NDN-VC.

Named data networking (NDN) uses the content name instead of its location within the interest message to locate the content within the network. An interest is broadcasted by the content seeking node over the wireless channel with specific content name and waits for the data message containing the actual content. The broadcast region of an interest is restricted by using the time-to-live (TTL) field of the message. Record of every pending interest is stored in the pending interest table (PIT) for a specific duration, called PIT entry lifetime (PEL). The record is purged when a node either receives the data message or the PEL expires. The size of the PIT has a significant impact on the name prefix search during the interest or data message forwarding process. Additionally, the interest and/or data message loss in the vehicular network is very frequent, which results in a significant PIT size depending on the PEL. Vanilla NDN uses the fixed PEL of $4\text{ s}$ , and the very recent work considers the constant parameters to control the PEL, which fails to reduce the PIT size. Hence, in this paper, we propose a hop limit based adaptive PEL (LAPEL) scheme, which adaptively estimates the PEL at interest forwarding vehicle. LAPEL estimates PEL based on the lower layer parameters and has no constant factor that makes it more adaptive than the previously proposed schemes. Simulation results show that LAPEL has $52\%$ less PEL, reduces $8.4\%$ the PIT size, and achieves $4.5\%$ more interest satisfaction ratio, for any simulated TTL and interest rates.

Modern vehicles equipped with a large number of electronic components, sensors, actuators, and extensive connectivity, are the classical example of cyber-physical systems (CPS). Communication as an integral part of the CPS has enabled and offered many value-added services for vehicular networks. The communication mechanism helps to share contents with all vehicular network nodes and the surrounding environment, e.g., vehicles, traffic lights, and smart road signs, to efficiently take informed and smart decisions. Thus, it opens the doors to many security threats and vulnerabilities. Traditional TCP/IP-based communication paradigm focuses on securing the communication channel instead of the contents that travel through the network. Nevertheless, for content-centered application, content security is more important than communication channel security. To this end, named data networking (NDN) is one of the future Internet architectures that puts the contents at the center of communication and offers embedded content security. In this paper, we first identify the cyberattacks and security challenges faced by the vehicular CPS (VCPS). Next, we propose the NDN-based cyber-resilient, the layered and modular architecture for VCPS. The architecture includes the NDN’s forwarding daemon, threat aversion, detection, and resilience components. A detailed discussion about the functionality of each component is also presented. Furthermore, we discuss the future challenges faced by the integration of NDN with VCPS to realize NDN-based VCPS.

Named data networking and software defined networking share mutual courage in changing legacy networking architectures. In the case of NDN, IP-based communication has been tackled by naming the data or content itself, while SDN proposes to decouple the control and data planes to make various services manageable without physical interference with switches and routers. Both NDN and SDN also support communication via heterogeneous interfaces and have been recently investigated for vehicular networks. Na�ve VNs are based on the IP-based legacy, which is prone to several issues due to the dynamic network topology among other factors. In this article, we first see both SDN and NDN enabled VNs from a bird's eye view, and for the very first time, we present an architecture that combines SDN functionalities within VNs to retrieve the required content using NDN. Moreover, we discuss a number of current research challenges and provide a precise roadmap that can be considered for the research community to jointly address such challenges.

Wireless communications and networking have been continually evolving to improve and be a part of our lifestyle. This uninterrupted development is due to many research projects and practices that are being carried out to improve the quality of services and applications supported by networking technologies. Initially, the plethora of computer networks research was designed to allow users to share the thoughts and facts using textual data through addressing devices. Meanwhile, we have witnessed that users play the role of both producers and consumers at the same time. These new emerging requirements gave birth to Cloud Computing (CC), Data Centric Networking (DCN), and other advancements in IEEE standards. Moreover, researchers also intended to redesign the networking architectures and protocols with the focus on content rather than the host. The resulting new architectures are Information Centric Networks (ICN) with various extensions like Content Centric Networks (CCN), Named Data Networks (NDN), Data-Oriented Network Architecture, etc.

A smart city enhances the quality of its citizens’ lives by providing ease of access to ubiquitous services through integration using communication systems at the foundation. Additionally, ITS plays a major role in making a metropolitan area into a smart city. The current IP-based solutions for ITS have slanted the performance due to high demand for data on the move, especially when the consumers become the producers. Meanwhile, NDN has evolved as a promising future Internet architecture and is being investigated extensively. In this article, we discuss the core functionality of NDN followed by our new architecture proposed for ITS in smart cities. Also, we highlight the current and future research challenges for NDN-enabled ITS in the context of smart cities.

The Microservice architecture is a design inspired by service oriented system that has recently gaining popularity and that promises to change the way in which software is design, developed and deployed. In this paper we will show comparative analysis of SOA and Microservice oriented architecture with its complete paradigms. Now a day’s business applications have common requirement to deal with large amount of data within a minimum amount of time by end user especially market is high for hand held devices therefore software design should be highly scalable, secure and have minimum amount of response time. In this paper We examine the cost, performance and scalability for this purpose two techniques are simulated first is based on SOA or monolithic and second is high grain Microservice architecture implemented on our business application which is Services trade link using for public to post their home maintenance jobs and can search different services and service providers for avail their services to make work easy and quick in their busy life in different category as per requirement and services provider also register their business in different category and can search their relevant business over this application so we are expecting huge traffic and lot of data on this application that’s why we need to select correct architecture for this purpose also we are focusing mobile user as well.

IEEE 802.15.4 standard is specifically designed for a low-rate and low-processing Internet of things (IoT) applications and offers guaranteed time slots. A beacon-enabled IEEE 802.15.4 consists of a superframe structure that comprises of the contention access period and contention-free period. During contention-free period, nodes transfer their data using guaranteed time slots without any collision. The coordinator node receives data transmission requests in one cycle and allocates guaranteed time slots to the nodes in the next cycle. This allocation process may cause large delay that may not be acceptable for few applications. In this work, a novel superframe structure is proposed that significantly reduces guaranteed time slots allocation delay for the nodes with data requests. The proposed superframe structure comprises of two contention access periods and one contention-free period, where contention-free period precedes both contention access periods with reduced slot size. In addition, the knapsack algorithm is modified for better guaranteed time slots allocation by allowing more guaranteed time slots requesting nodes to send their data as compared to the IEEE 802.15.4 standard. The simulation and analytical results show that the proposed superframe structure reduces the network delay by up to 80%, increases contention-free period utilization up to 50%, and allocates guaranteed time slots up to 16 nodes in a single superframe duration.

Vehicular named data network (VNDN) has emerged as a promising network technology, where the focus of communication is moved from host-centric to information-centric. Since, the VNDN is at its early stage in development, there are several open issues to be explored and pending interest table (PIT) management is one of them. In VNDN, PIT stores each broadcasted interest until the required content is retrieved or its timer (PEL: PIT entry lifetime) expires. When the PIT storage is full, the vehicles discard new incoming interests, thus decreasing the network performance. Therefore, in this letter, we propose a dynamic PEL (DPEL) scheme that enables each relaying vehicle to dynamically compute PEL timer for each incoming interest using its interest satisfaction rate (ISR) and the hop count. The higher the ISR and the longer the hop count, the shorter the time the relaying vehicle keeps the PIT entry. Simulation results show DPEL reduces by more than 75% the PEL and the number of entries in VNDN.

Smart cities have been envisioned during the last decade. Moreover, various projects have been initiated to bring this concept into reality. Smart city is basically an emergence of the existing and new Information and Communications Technologies (ICT) to make our living standard more safe and digitized. Wireless communications, such as sensors, actuators, intelligent transportation systems, and smart grids, have played a vital role in the dissemination of information under the given circumstances. Similarly, it is hard to declare any city as a smart city without taking benefits from wireless sensor networks (WSNs). However, with new requirements and delay sensitive applications, the existing WSN requires significant alterations at several layers. In this paper, a new time division multiple access (TDMA)-based medium access control (MAC) protocol, called bitmap-assisted efficient and scalable TDMA-based MAC (BEST-MAC), is proposed for adaptive traffic in hierarchical WSNs that can be deployed in the smart cities. BEST-MAC is specifically designed to improve the quality control of such smart cities applications, where diverse traffic is required and loss or delay in data traffic is unacceptable. The main contributions of BEST-MAC include: 1) it uses small size time slots; 2) the number of those time slots is more than the number of member nodes; 3) knapsack algorithm is used to schedule time slots; and 4) short node address (1 B) is proposed to identify the member nodes. First two contributions of BEST-MAC handle adaptive traffic loads of all members in an efficient manner. The knapsack algorithm not only reduces the job completion time of a node but also minimizes the average packet delay with better link utilization. The short node address reduces the control overhead that improves the energy efficiency. The simulation results verify that the proposed BEST-MAC transmits more data with less delay and energy consumption compared with the existing MAC protocols.

Content-Centric Network (CCN) is a promising future Internet architecture, attracting research community and being widely adopted in the vehicular networks. The main concept of CCN is to smoothly distribute digital contents between the content provider and consumer. In these types of networks, contents are identified by unique names, however, naming those contents is still a challenging task. Therefore, we propose a hierarchical and hash based naming with efficient Compact Trie (CT) management scheme for Vehicular Content-Centric Network (VCCN). The proposed naming scheme makes the best use of the features offered by hierarchical as well as hash-based or flat naming schemes. The hierarchical part of the digital content name contains information about the content provider, type, its sub-types and attributes of the content itself that is shared between vehicles. The hash part uniquely identifies the digital content required for VCCN applications. The proposed naming scheme satisfies two main purposes: first, it helps in minimizing the routing table by aggregating the name prefixes and simplifying the routing decisions. Second, it contains attributes, spatial, temporal and their range information to easily find and resolve the content. The proposed scheme manages prefixes (e.g. Add, Search and Delete) in the tables e.g. Forwarding Information Base (FIB), Pending Interest Table (PIT), etc. The CT is relatively faster and space-efficient than Simple Trie and has better performance compared to the existing solutions of naming the required content(s). The evaluation results show that the proposed CT based prefix management scheme performs 45.5% and 23.3% faster prefix search and 55% and 34% faster prefix delete operation compared to Simple Trie and Bloom-Filter based name management schemes, respectively. The memory profile results show that average memory consumption of the proposed CT implementation is 24 and 186 times smaller than the Simple Trie and the NLAPB, respectively.

Named data networking has been efficiently utilized in Vehicular networks as a promising solution to enable reliable and efficient content retrieval. Vehicular named data networks (VNDN) employ a pull-based mechanism where an Interest packet is broadcast in order to receive the Content. This forwarding scheme mitigates the forwarding of unsolicited content, however, the dissemination of critical data forwarding generated randomly in the network is not considered. For instance, in the vanilla NDN framework any content received by a vehicle is considered unsolicited and dropped provided no corresponding entry is available in the pending interest table of that vehicle. Despite its potential, some modification in the NDN architecture are required to forward the high priority critical content. In this work, we enable the vehicles' NDN forwarding mechanism to reliably share the critical content from different vehicles sources in the networks. The solution is evaluated in NS2 and the findings show that the proposed scheme is able to collect the data from several vehicles in the networks with reduced network overhead and data retrieval delays.

Vehicular Named Data Network (VNDN) uses NDN as an underlying communication paradigm to realize intelligent transportation system applications. Content communication is the essence of NDN, which is primarily carried out through content naming, forwarding, intrinsic content security, and most importantly the in-network caching. In vehicular networks, vehicles on the road communicate with other vehicles and/or infrastructure network elements to provide passengers a reliable, efficient, and infotainment-rich commute experience. Recently, different aspects of NDN have been investigated in vehicular networks and in vehicular social networks (VSN); however, in this paper, we investigate the in-network caching, realized in NDN through the content store (CS) data structure. As the stale contents in CS do not just occupy cache space, but also decrease the overall performance of NDN-driven VANET and VSN applications, therefore the size of CS and the content lifetime in CS are primary issues in VNDN communications. To solve these issues, we propose a simple yet efficient multi-metric CS management mechanism through cache replacement (M2CRP). We consider the content popularity, relevance, freshness, and distance of a node to devise a set of algorithms for selection of the content to be replaced in CS in the case of replacement requirement. Simulation results show that our multi-metric strategy outperforms the existing cache replacement mechanisms in terms of Hit Ratio.

Flying Ad hoc Network (FANET) is a new resource-constrained breed and instantiation of Mobile Ad hoc Network (MANET) employing Unmanned Aerial Vehicles (UAVs) as communicating nodes. These latter follow a predefined path called &rsquo, mission&rsquo, to provide a wide range of applications/services. Without loss of generality, the services and applications offered by the FANET are based on data/content delivery in various forms such as, but not limited to, pictures, video, status, warnings, and so on. Therefore, a content-centric communication mechanism such as Information Centric Networking (ICN) is essential for FANET. ICN addresses the problems of classical TCP/IP-based Internet. To this end, Content-centric networking (CCN), and Named Data Networking (NDN) are two of the most famous and widely-adapted implementations of ICN due to their intrinsic security mechanism and Interest/Data-based communication. To ensure data security, a signature on the contents is appended to each response/data packet in transit. However, trusted communication is of paramount importance and currently lacks in NDN-driven communication. To fill the gaps, in this paper, we propose a novel trust-aware Monitor-based communication architecture for Flying Named Data Networking (FNDN). We first select the monitors based on their trust and stability, which then become responsible for the interest packets dissemination to avoid broadcast storm problem. Once the interest reaches data producer, the data comes back to the requester through the shortest and most trusted path (which is also the same path through which the interest packet arrived at the producer). Simultaneously, the intermediate UAVs choose whether to check the data authenticity or not, following their subjective belief on its producer&rsquo, s behavior and thus-forth reducing the computation complexity and delay. Simulation results show that our proposal can sustain the vanilla NDN security levels exceeding the 80% dishonesty detection ratio while reducing the generated end-to-end delay to less than 1 s in the worst case and reducing the average consumed energy by more than two times.

Low rate and low processing wireless applications are under high demands since last decade. Most of these applications use IEEE 802.15.4 standard on their physical and Medium Access Control (MAC) layers. The standard operates in 868MHz, 915MHz, and 2400MHz frequency bands, and offers superframe structure in its beacon enabled modes. This superframe structure comprises of Contention Access Period (CAP) and Contention Free Periods (CFP). During CFP, nodes are allocated Guaranteed Time Slots (GTS) to transfer their data. In this work, CFP slots of superframe structure have been fine-tuned for better link utilization. A knapsack optimization algorithm is designed to accommodate more CFP requesting nodes. The proposed scheme improves the link utilization and accommodates more nodes as compared to the existing standard. The analytical results show that our proposed work improves the link utilization almost 50% and allows up to double of nodes as compared to the standard on all three frequency bands.

During the past two decades, we have witnessed a tremendous development in Vehicular networks, while exploring emerging communication technologies such as vehicular cyber-physical systems (VCPS). Basically, VCPS requires multimodal data from the physical system to take appropriate decision and actions, for example, the congestion warnings, applying brakes, adjusting speed limits, etc. However, there are multiple systems interconnected in the VCPS with different communication capabilities and data communication between those systems that lead us to a challenging task. In this paper, we consider named data networking (NDN) as a promising solution to enhance the reachability of Data among multi-hop VCPS. NDN offers a simple pull-based content communication in the network with multiple interfaces and also supports heterogeneity in terms of communications technologies. The proposed NDN forwarding scheme enables vehicles to send one Interest (request) to collect multiple instances of the Data from different content sources in the network. Simulation results show that the proposed scheme can collect information from many nodes that are at longer distance from the information requesting nodes.

Recently nature-inspired optimization algorithms have become a popular choice for solving complex optimization problems. Water Cycle Algorithm (WCA) is a nature-inspired new optimization technique, which has successfully applied to solve the constrained optimization and engineering design problems. As a result, the WCA studies have extended significantly in the last 5 years. This review paper provides the comprehensive assessment of WCA in the area of modifications, hybridizations, and applications. Moreover, it will provide the awareness to the researchers how the current algorithm can be modified according to the nature of the problems. The narrative of how WCA was used in the tactics for solving these kinds of problems. Future research directions are also discussed based on the comprehensive conclusion as well as discussion. To the best of our knowledge, this is the first review article which has enclosed extensive information about the WCA and its applications.

In this article, a secure and verifiable electronic voting scheme is proposed. Encrypted votes are accumulated and prepared in the form of block on each electronic polling booth at the end of polling time. The resultant block from each electronic polling booth is distributed to the authorized nodes of group for temper proof block chaining that assures the internal verifiability. The external verifiability is attained through the redistribution of temper proof Blockchain ledger to the validated and authorized nodes of auditing group. The temper proof property of electoral data is achieved using an emerging Blockchain Technology. Whereas the secure data distribution in the form of temper proof blocks and ledger amongst the authenticated group members is accomplished through the cryptographically secure group oriented scenario. The individual and universal verifiability features in our proposed scheme make the electoral process transparent, reliable and verifiable.

Vehicular Content-Centric Network (VCCN) has emerged as a future network technology for vehicular networks, where the focus of communication is shifted from the host to information centric. However, VCCN faces several challenges, including interest/data packet(s) flooding, provider/consumer mobility, and so on. In this letter, we propose a scheme named RobUst Forwarder Selection (RUFS) to mitigate the interest broadcast storm. In RUFS, each vehicle shares its satisfied interest(s) statistics with neighbors. All neighbors store this information in their Neighbors Satisfied List (NSL), which helps to select the potential interest forwarder. Simulation results show that RUFS outperforms the recently proposed NAIF, DR based and basic interest forwarding in VCCN.

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

Vehicular delay tolerant networks have proven to be a low-cost solution with an attempt to provide connectivity in the presence of vehicular mobility. In this paper, we propose a bivious relaying scheme to minimize the communication outage experienced by a vehicle within an uncovered area between two distant neighboring Road Side Units (RSUs). Our proposed scheme selects two relays for a target vehicle, one when it leaves the coverage area and the other when it is on the way to enter the next distant RSU. We analyze the effect of our proposed bivious relaying scheme with the existing single relay selection scheme using the interior point algorithm. Monte-Carlo technique is also used with 100,000 iterations to show the behavior of this stochastic process. The analytical results show that the bivious relaying scheme provides a better minimized communication outage time compared to the single relaying scheme.

WiMAX offers promising data rate, low deployment cost and support for Vehicular Networks (VNs). In VNs, vehicles have high mobility as they move from the coverage area of a Serving-RSU (S-RSU) to a Target-RSU (T-RSU). When moving from a S-RSU to another RSU, every vehicle should complete handover process. However, seamless handover is one of the major challenges in WiMaX while supporting real-time applications for VNs. Handover latency mainly results from the T-RSU selection and scanning of multiple channels. In this paper, we therefore propose an efficient network assisted handover scheme which attempts to reduce the T-RSU selection and scanning time of Mobile Stations (MSs) during the handover process. Our scheme allows a S-RSU to calculate the amount of time during which an MS can receive services from a forthcoming T-RSU based on its velocity and a coverage area of the T-RSU, which is defined as Coverage/Service Time. Later on, S-RSU uses this coverage time for the selection of the T-RSU. In addition, a serving RSU also aids an MS with channel information and estimated time to start scanning in order to get associated with its T-RSU. Thus, our scheme allows the MS to scan only one channel of the selected T-RSU. Using the NS-2 simulator, for evaluation, we compared our scheme with some existing solutions. The simulation results show that due to the pre-selection of a reliable T-RSU, our proposed scheme efficiently reduces the network overhead. Furthermore, aiding an MS with channel information of a T-RSU reduces overall scanning latency and increases the network throughput.

Timely detection of anomalous activity in wireless sensor network is critical for the smooth working of the network. This paper presents an intrusion detection technique based on the calculation of trust of the neighboring node. In the proposed IDS, each node observes the trust level of its neighboring nodes. Based on these trust values, neighboring nodes may be declared as trustworthy, risky or malicious. Trustworthy nodes are recommended to the forwarding engine for packet forwarding purposes. The proposed scheme successfully detects Hello flood attack, jamming attack and selective forwarding attack by analyzing the network statistics and malicious node behavior. The simulation results show that network performs better when neighbor node trust management based anomaly detection technique is in place.

This chapter describes the recently proposed Future Internet architectures followed by insight and discussion on named data networking (NDN). It also describes the possible applicability of NDN in smart cities and its potentials. To date, Palo Alto Research Center (PARC) proposed a promising Future Internet architecture named as CCN. The NDN is providing its part to further enhance CCN project and is funded by the US Future Internet Architecture program. The chapter also summarizes the current advancements in the field of CNN and named data networks that are relevant to the smart cities. CCN claims and focuses on securing the content using public key encryption rather than the connection, which means that it promises that the content is same as it asserts. Finally, the chapter provides variant application scenarios for NDN‐enabled smart cities and future research road map for researchers.

Underwater Sensor Networks (UWSNs) have been realized as a potential solution for offshore monitoring, undersea military applications, smart fishing, and so on. However, the current communication systems for underwater nodes are facing non-trivial challenges due to the constrained networking conditions. For instance, the sink addresses the node(s) by using their ID(s) to pull the sensed information. However, it is not obvious that the addressed nodes in request message actually are able to provide the requested data. Meanwhile, the Named Data Networking (NDN), aka Content-Centric Networking (CCN), is recently emerged as a potential future Internet architecture. NDN uses the Data Names to pull the required information rather than the IP addresses. In this paper, we check the feasibility of applying NDN into UWSN and name it as UNDN. In addition, we propose the very first naming scheme for UNDN and present the preliminary evaluations.

The nature of World Wide Web (www) has evolved over the passage of time. Easier and faster availability of Internet has given rise to huge volumes of data available online. Another cause of huge volumes of data is the emergence of online social networks (like Facebook, Twitter, etc.) which has actually changed the role of data consumers to data generators. Increasing popularity of these online social networks has also changed the way different web services used to be used. For example, Facebook messaging has some impact on usage of emails; twitter usage affects (positively or negatively) online newspaper readings. Both of these platforms are heavily used for information searching. In this paper, we evaluate the role of Facebook and Twitter for academic queries and compare the findings with Google search engines to find out if there is a chance that these online social networks will replace Google sooner. A query set selected from the standard AOL dataset is used for experimentation. Academic related queries are selected and classified by expert users. Findings of Google, Facebook and Twitter are compared against these queries using Mean Average Precision (MAP), as a metrics for evaluation. Results conclude that Google has the dominating factor with a better MAP than Facebook and Twitter.

As small-sized nodes are deployed in Wireless Sensor Networks (WSNs), efficient energy utilization becomes a fundamental challenge. Poor channel conditions lead to retransmissions resulting in unnecessary energy usage. To optimize energy consumption and improve network lifetime, error-control strategies are commonly required to manage channel impairments such as noise and fading. Cooperative commu nication is also considered a candidate solution to address the effects of channel fading. Therefore, the energy efficiency of cooperative schemes when applied with Automatic Repeat Request (ARQ), Hybrid-ARQ (HARQ), and Forward Error Correction (FEC) is investigated in this work. Moreover, expressions for energy efficiency of Direct Transmission, Single Relay Cooperation, and Multi Relay Cooperation are derived. Our work focuses on achieving energy-optimal communication in WSNs. Through simulations, it is observed that error-control strategies with a cooperative scheme can significantly enhance system performance in terms of energy optimization.

This study presents comparison of Access Techniques used in Medium Access Control (MAC) protocol for Wireless Body Area Networks (WBANs). Comparison is performed between Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA), Pure ALOHA and Slotted ALOHA (S-ALOHA). Performance metrics used for comparison are Throughput (T), Delay (D) and offered load (G). The main goal for comparison is to show which technique gives highest Throughput and lowest Delay with increase in Load. Energy efficiency is major issue in WBAN that is why there is need to know which technique performs best for energy conservation and also gives minimum delay. Simulations are performed for different scenarios and results are compared for all techniques. We suggest TDMA as best technique to be used in MAC protocol for WBANs due to its high throughput and minimum delay with increase in load. MATLAB is the tool that is used for simulation.

Increasing consumer motivation to pursue online reviews and information has recently become a potential area of study. Perusing the literature reviews, it is fairly evident that disseminating information largely depends on the innovativeness and the interpretative caliber of writers. Individuals that are involved in electronic word of mouth communication may have high ambitions to realize the needs and requirements of the online community. Different consumers have different concerns such as helping the company, obtaining social benefits, communicating post-purchase opinions, self-enhancement, and the expression of positive and negative viewpoints. Therefore, more studies are required to unveil the comprehensive features of online information and portal members' behavior.

[EN] Recently, named data networking (NDN) has been proposed as a promising architecture for future Internet technologies. NDN is an extension to the content-centric network (CCN) and is expected to support various applications in vehicular communications [ vehicular NDN (VNDN)]. VNDN basically relies on naming the content rather than using end-to-end device names. In VNDN, a vehicle broadcasts an "Interest" packet for the required "content," regardless of end-to-end connectivity with servers or other vehicles and known as a "consumer." In response, a vehicle with the content replies to the Interest packet with a "Data" packet and named as a "provider." However, the simple VNDN architecture faces several challenges such as consumer/provider mobility and Interest/Data packet(s) forwarding. In VNDN, for the most part, the Data packet is sent along the reverse path of the related Interest packet. However, there is no extensive simulated reference available in the literature to support this argument. In this paper, therefore, we first analyze the propagation behavior of Interest and Data packets in the vehicular ad hoc network (VANET) environment through extensive simulations. Second, we propose the "CODIE" scheme to control the Data flooding/broadcast storm in the naive VNDN. The main idea is to allow the consumer vehicle to start hop counter in Interest packet. Upon receiving this Interest by any potential provider, a data dissemination limit (DDL) value stores the number of hops and a data packet needs to travel back. Simulation results show that CODIE forwards fewer copies of data packets processed (CDPP) while achieving similar interest satisfaction rate (ISR), as compared with the naive VNDN. In addition, we also found that CODIE also minimizes the overall interest satisfaction delay (ISD), respectively., This work was supported by the Ministry of Science, ICT and Future Planning, South Korea, under Grant IITP-2015-H8601-15-1002 of the Convergence Information Technology Research Center supervised by the Institute for Information and Communications Technology Promotion. The review of this paper was coordinated by Editors of CVS. (Corresponding author: Dongkyun Kim.)

Recently, Vehicular Ad Hoc Networks (VANETs) have been providing a number of services for on-road users, including video content retrieval using 3G and 4G networks. However, owing to the highly dynamic network topology of VANETs, such services is highly susceptible to poor performance. In such a real-time scenario, a requesting vehicle may not be able to guarantee the video quality using its own wireless interface independently. Thus, motivated to provide a quality video stream, we propose a Fleet Based video Retrieval (FBR) scheme that allows the requesting vehicle to download the H.264/SVC encoded video stream in collaboration with its 1-hop neighbors. The collaborators are selected considering the multiple characteristics of each neighboring vehicle, i.e., 1-hop distance, link duration, velocity, and the available cellular bandwidth. The selected vehicles download the video data using their wireless link and then forward it to the requested vehicle through a Dedicated Short-Range Communication (DSRC) protocol. For comparison, we first evaluate our FBR with 3G equipped vehicles and secondly, we designed FBR to work in 4G/LTE environment. Through simulations, we found that FBR has outperformed the recently proposed scheme in terms of receiving video quality and video-flow handling.

Vehicular Ad hoc Networks (VANETs) have been providing promising solutions for both the safety and non-safety requirements of 21st century drivers. Since, the number of vehicles are increasing, the current host centric communication approach faces various challenges. On the other hand, the Information Centric Networking (ICN) concept in vehicular communications aims to achieve content retrieval in the dynamic and error prone environment. Recently, the concept Vehicular ICN (VICN), has been explored extensively by researchers, leading to a number of open challenges such as, content naming, name resolution, Interest forwarding strategies, content store, forwarding information base and pending interest table management, security and trust issues, etc. In this paper, we therefore discuss the recent advancements in different VICN approaches with more focus on the Interest forwarding strategies which have been applied during the content retrieval process.

In the first decade of the 21st century, the cyber world and the physical world were considered as two different entities. However, in the literature we can easily find that these two entities are closely correlated with each other after integration of sensor and actuators in the cyber systems. Cyber systems became responsive to the physical world by enabling real-time control emanating from conventional embedded systems, thus giving birth to a new research paradigm named the cyber-physical system (CPS). In this chapter, we investigate the major challenges in integrating the cyber world with the physical world and its applications, followed by the basics and fundamentals of CPS. In addition, we discuss the CPS requirements for building its architectures, which should contain several modules supporting the CPS. The motivation of this chapter is to provide an overview of the CPS and the prerequisite knowledge for modeling and simulations.

During the past decades, serious efforts have been made to propose various architectures for the future Internet. Each of those architectures has one thing in common, i.e., to focus on content delivery rather than on host-centric approaches. However, only few of them gained popularity due to their possible applications being investigated. In this chapter, we describe the overview of various future Internet architectures such as data-oriented networking architecture, content-centric networking, named-data networking, publish/subscribe, and network of information. The main objective of this chapter is to allow our readers to become familiar with the transformation of these architectures.

Recently, various applications for Vehicular Ad hoc Networks (VANETs) have been proposed and smart traffic violation ticketing is one of them. On the other hand, the new Information-Centric Networking (ICN) architectures have emerged and been investigated into VANETs, such as Vehicular Named Data Networking (VNDN). However, the existing applications in VANETs are not suitable for VNDN paradigm due to the dependency on a“named content”instead of a current“host-centric”approach. Thus, we need to design the emerging and new architectures for VNDN applications. In this paper, we propose a smart traffic violation ticketing (TVT) system for VNDN, named asSmartCop, that enables a cop vehicle (CV) to issue tickets for traffic violation(s) to the offender(s) autonomously, once they are in the transmission range of that CV. The ticket issuing delay, messaging cost, and percentage of violations detected for varying number of vehicles, violators, CVs, and vehicles speeds are estimated through simulations. In addition, we provide a road map of future research directions for enabling safe driving experience in future cars aided with VNDN technology.